Pivot selection techniques for proximity searching in metric spaces

Pattern Recognition Letters

Volumn 24, Issue 14, 2003, Pages 2357-2366

  Bustos, Benjamin ^a,b   Navarro, Gonzalo ^b   Chávez, Edgar ^c  

^a UNIVERSITY OF KONSTANZ   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSIDAD MICHOACANA DE SAN NICOLÁS DE HIDALGO   (Mexico)

Author keywords

Metric databases; Nearest neighbor search; Pivot based indexing; Range queries

Indexed keywords

ALGORITHMS; OPTIMIZATION; PERFORMANCE;

METRIC SPACES;

PATTERN RECOGNITION;

NEAREST NEIGHBOR ANALYSIS; PATTERN RECOGNITION;

EID: 0041339760     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8655(03)00065-5     Document Type: Article

References (13)

1. Baeza-Yates, R., Cunto, W., Manber, U., Wu, S., 1994. Proximity matching using fixed-queries trees. In: Proc. 5th Combinatorial Pattern Matching (CPM'94). In: LNCS, vol. 807. pp. 198-212
2. Bozkaya, T., Ozsoyoglu, M., 1997. Distance-based indexing for high-dimensional metric spaces. In: Proc. ACM SIGMOD International Conference on Management of Data. pp. 357-368. Sigmod Record 26(2)
3. Brin, S., 1995. Near neighbor search in large metric spaces. In: Proc. 21st Conference on Very Large Databases (VLDB'95). pp. 574-584
4. Burkhard W. Keller R. Some approaches to best-match file searching Comm. ACM 16 4 1973 230-236
5. Chávez E. Marroqún J. Baeza-Yates R. Spaghettis: An array based algorithm for similarity queries in metric spaces Proc. String Processing and Information Retrieval (SPIRE'99) 1999 38-46 IEEE CS Press
6. Chávez E. Marroqún J. Navarro G. Fixed queries array: A fast and economical data structure for proximity searching Multimedia Tools Appl. (MTAP) 14 2 2001 113-135
7. Chávez E. Navarro G. Baeza-Yates R. Marroqún J. Proximity searching in metric spaces ACM Comput. Surveys 33 3 2001 273-321
8. Faragó A. Linder T. Lugosi G. Fast nearest-neighbor search in dissimilarity spaces IEEE Trans. Pattern Anal. Machine Intell. 15 9 1993 957-962
9. Filho, R.S., Traina, A., Traina Jr., C., Faloutsos, C., 2001. Similarity search without tears: The OMNI family of all-purpose access methods. In: ICDE. pp. 623-630
10. Micó L. Oncina J. Vidal E. A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements Pattern Recognition Letters 15 1994 9-17
11. Vidal E. An algorithm for finding nearest neighbors in (approximately) constant average time Pattern Recognition Letters 4 1986 145-157
12. Yianilos, P., 1993. Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93). pp. 311-321
13. Yianilos, P., 1999. Excluded middle vantage point forests for nearest neighbor search. In: DIMACS Implementation Challenge, ALENEX'99, Baltimore, MD