On the geometry of similarity search: dimensionality curse and concentration of measure

Information Processing Letters

Volumn 73, Issue 1-2, 2000, Pages 47-51

  Pestov, Vladimir ^a  

^a VICTORIA UNIVERSITY OF WELLINGTON   (New Zealand)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; FUNCTIONS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; QUERY LANGUAGES; SET THEORY; THEOREM PROVING;

CONCENTRATION OF MEASURE; DIMENSIONALITY CURSE; SIMILARITY SEARCH;

DATA STRUCTURES;

EID: 0033909182     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(99)00156-8     Document Type: Article

References (14)

1. Berchtold S., Böhm C., Keim D.A., Kriegl H.-P. A cost model for nearest neighbor search in high-dimensional data space. Proc. 16th Annual ACM Symposium on Principles of Database Systems (PODS'97), Tucson, AZ. 1997;78-86.
2. Beyer K., Goldstein J., Ramakrishnan R., Shaft U. When is "nearest neighbor" meaningful? Proc. 7th Internat. Conf. on Database Theory (ICDT-99), Jerusalem, Israel. 1999;217-235.
3. Bentley J.L., Weide B.W., Yao A.C. Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Software. Vol. 6:1980;563-580.
4. Brin S. Near neighbor search in large metric spaces. Proc. 21st VLDB International Conf., Zurich, Switzerland. 1995;574-584.
5. Ciaccia P., Patella M., Rabitti F., Zezula P. Performance of M -tree, an access method for similarity search in metric spaces. EC ESPRIT Report:24 February 1997;. 25 pp., downloadable from http://www.ced.tuc.gr/hermes.
6. Ciaccia P., Patella M., Zezula P. A cost model for similarity queries in metric spaces. Proc. 17th Annual ACM Symposium on Principles of Database Systems (PODS'98), Seattle, WA. 1998;59-68.
7. Gromov M., Milman V.D. A topological application of the isoperimetric inequality. Amer. J. Math. Vol. 105:1983;843-854.
8. Hellerstein J.M., Koutsoupias E., Papadimitriou C.H. On the analysis of indexing schemes. Proc. 16th Annual ACM Symposium on Principles of Database Systems (PODS'97), Tucson, AZ. 1997;249-256.
9. Milman V.D. The heritage of P. Lévy in geometric functional analysis. Astérisque. Vol. 157-158:1988;273-301.
10. Milman V.D., Schechtman G. Asymptotic Theory of Finite Dimensional Normed Spaces. Lecture Notes in Math. Vol. 1200:1986;Springer, Berlin.
11. Silberschatz A., Stonebraker M., Ullman J. Database research: Achievements and opportunities into the 21st century. Report of an NSF Workshop on the Future of Database Systems Research. May 26-27, 1995.
12. Talagrand M. Concentration of measure and isoperimetric inequalities in product spaces. Publ. Math. IHES. Vol. 81:1995;73-205.
13. Uhlmann J.K. Satisfying general proximity/similarity queries with metric trees. Inform. Process. Lett. Vol. 40:1991;175-179.
14. Weber R., Schek H.-J., Blott S. A quantatitive analysis and performance study for similarity-search methods in high-dimensional spaces. Proc. 24th VLDB Conference, New York. 1998;194-205.