Engineering efficient metric indexes

Pattern Recognition Letters

Volumn 28, Issue 1, 2007, Pages 75-84

  Fredriksson, Kimmo ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

Algorithms; Bit parallel distance evaluations; Data structures; Information retrieval; Memory adaptiveness; Metric space indexing; Proximity searching

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; DATA STRUCTURES; INFORMATION RETRIEVAL; VECTORS;

BIT-PARALLEL DISTANCE EVALUATIONS; MEMORY ADAPTIVENESS; METRIC SPACE INDEXING; PROXIMITY SEARCHING;

MATRIX ALGEBRA;

EID: 33750441137     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2006.06.012     Document Type: Article

References (16)

1. Baeza-Yates R., and Ribeiro-Neto B. Modern Information Retrieval (1999), ACM Addison-Wesley
2. Bingham E., and Mannila H. Random projection in dimensionality reduction: Applications to image and text data. Proc. (KDD'01) (2001), ACM Press 245-250
3. Burkhard W.A., and Keller R.M. Some approaches to best-match file searching. Comm. ACM 16 4 (1973) 230-236
4. Bustos B., Navarro G., and Chávez E. Pivot selection techniques for proximity searching in metric spaces. Pattern Recognition Lett. 24 14 (2003) 2357-2366
5. Chávez E., and Navarro G. An effective clustering algorithm to index high dimensional metric spaces. Proc. 7th Internat. Symposium on String Processing and Information Retrieval (SPIRE'2000) (2000), IEEE CS Press 75-86
6. Chávez E., and Navarro G. Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces. Inf. Process. Lett. 85 (2003) 39-46
7. Chávez E., and Navarro G. A compact space decomposition for effective metric indexing. Pattern Recognition Lett. 26 9 (2005) 1363-1376
8. Chávez E., Navarro G., Baeza-Yates R., and Marroquin J.L. Searching in metric spaces. ACM Comput. Surveys 33 3 (2001) 273-321
9. Fredriksson K. Metric indexes for approximate string matching in a dictionary. Proc. 11th Internat. Symposium on String Processing and Information Retrieval (SPIRE'2004). LNCS vol. 3246 (2004), Springer-Verlag 212-213
10. Hjaltason G.R., and Samet H. Index-driven similarity search in metric spaces. ACM Trans. Database Systems (TODS) 28 December (2003) 517-580
11. Hyyrö, H., Fredriksson, K., Navarro, G., 2004. Increased bit-parallelism for approximate string matching. In: Proc. 3rd Workshop on Efficient and Experimental Algorithms (WEA'04). LNCS, vol. 3059, pp. 285-298.
12. Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming. J. Assoc. Comput. Mach. 46 3 (1999) 395-415
13. Uhlmann J. Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett. (1991) 175-179
14. Vidal E. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Lett. 4 (1986) 145-157
15. Witten I.H., Moffat A., and Bell T.C. Managing Gigabytes Compressing and Indexing Documents and Images. 2nd ed. (1999), Morgan Kaufmann Publishers Inc.
16. Yianilos P. Data structures and algorithms for nearest neighbor search in general metric spaces. Proc. 4th ACM-SIAM Symposium of Discrete Algorithms (SODA'93) (1993), SIAM Press 311-321