Effectiveness of NAQ-tree as index structure for similarity search in high-dimensional metric space

Knowledge and Information Systems

Volumn 22, Issue 1, 2010, Pages 1-26

  Zhang, Ming ^a   Alhajj, Reda ^a,b  

^a UNIVERSITY OF CALGARY   (Canada)

^b GLOBAL UNIVERSITY   (Lebanon)

Author keywords

Dimensionality reduction; High dimensionality; Indexing; Knn search; Similarity search

Indexed keywords

DATA HANDLING; DIMENSIONALITY REDUCTION; EFFICIENCY; EQUIVALENCE CLASSES; FORESTRY; INDEXING (OF INFORMATION); OBJECT RECOGNITION; SET THEORY; STRUCTURES (BUILT OBJECTS); TOPOLOGY; TREES (MATHEMATICS);

COMPARATIVE TESTS; DISJOINT PARTITION; HIGH DIMENSIONALITY; HIGH-DIMENSIONAL METRIC SPACE; K-NN SEARCH; MULTIMEDIA DATABASE; SEARCH EFFICIENCY; SIMILARITY SEARCH;

NEAREST NEIGHBOR SEARCH;

EID: 75949100148     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-008-0190-y     Document Type: Article

References (34)

1. An J, Chen H, Furuse K, Ohbo N (2005) CVA file: an index structure for high-dimensional datasets. Knowl Inform Syst 7:337-357
2. Andoni A, Indyk P (2008) Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. Comm ACM 51(1):117-122
3. Berchtold S, Keim D, Kriegel HP (1996) The X-tree: an index structure for high-dimensional data. In: Proceedings of VLDB
4. Beyer K, et al (1999) When is "Nearest Neighbor" meaningful? In: Proceedings of IEEE ICDE
5. Bozkaya T, Ozsoyoglu M (1997) Distance-based indexing for high-dimensional metric spaces. In: Proceedings of ACM SIGMOD, pp 357-368
6. Brin S (1995) Near neighbor search in large metric spaces. In: Proceedings of VLDB, pp 574-584
7. Burkhard WA, Keller RM (1973) Some approaches to best-match file searching, Comm ACM 16(4):230-236
8. Chavez E, Navarro G (2005) A compact space decomposition for effective metric indexing. Pattern Recognit Lett 26(9): 1363-1376
9. Ciaccia P, Patella M, Zezula P (1997) M-Tree: an efficient access method for similarity search in metric spaces. VLDB J 426-435
10. Data set is available at: http://kdd.ics.uci.edu/databases/CorelFeatures/CorelFeatures.html
11. Cui B, Ooi BC, Su J, Tan T (2005) Indexing high-dimensional data for efficient in-memory similarity search. IEEE Trans Knowl Data Eng 17(3): 339-353
12. Dohnal V et al (2003) D-index: distance searching index for metric data sets. Multimedia Tools Appl 21(1)9:33
13. Filho RFS, Traina AJM, Traina C, Faloutsos C (2001) Similarity search without tears: the OMNI family of all-purpose access methods. In: Proceedings of IEEE ICDE, pp 623-630
14. Fu AW-C, et al (2000) Dynamic VP-tree indexing for N-Nearest search given pair-wise distances. VLDB J
15. Source code is available at http://www.cs.mu.oz.au/~rui/code.htm
16. Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) iDistance: an adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364-397
17. Katamaya N, Satoh S (1997) The SR-tree: an index structure for high-dimensional nearest neighbor queries. In: Proceedings of ACM SIGMOD
18. Data set is available at: http://kodiak.cs.cornell.edu/kddcup/datasets.html
19. Kailing K, Kriegel H-P, Pfeifle M, Schonauer S (2006) Extending metric index structures for efficient range query processing. Knowl Inform Syst 10(2):211-227
20. Kadiyala S, Shiri N (2008) A compact multi-resolution index for variable length queries in time series databases. Knowl Inform Syst 15:131-147
21. Lowe DG (2004) Distinctive image features from scale invariant features. IJCV 60(2):91-110
22. Nievergelt J, Hinterberger H, Sevcik KC (1984) The grid file: an adaptable, symmetric multikey file structure. ACM Trans Database Syst 9(1)
23. Pawlak Z (1991) Rough sets theoretical aspects of reasoning about data. Kluwer, Dordrecht
24. Seidl T, Kriegel HP (1998) Optimal multi-step k-nearest neighbor search. In: Proceedings of ACM SIGMOD
25. Shaft U, Ramakrishnan R (2005) When is nearest neighbors indexable? In: Proceedings of ICDT, pp 158-172
26. Traina C, Traina AJM, Seeger B, Faloutsos C (2000) Slim-trees: highet performance metric trees minimizing overlap between nodes. In: Proceedings of EDBT, pp 51-65
27. Uhlmann JK (1991) Satisfying general proximity/similarity queries with metric trees. Inform Process Lett 40:175-179
28. Venkateswaran J, Lachwani D, Kahveci T, Jermaine C (2006) Reference-based indexing of sequences databases. In: Proceedings of VLDB
29. Vieira, MR, Traina, C, Chino, FJT, Traina, AJM (2004) DBM-tree: a dynamic metric access methodsensitive to local density data. In: Proceedings of SBBD, pp 163-177
30. Source code is available at: http://www.cse.cuhk.edu.hk/~kdd/program.html
31. White DA, Jain R (1996) Similarity indexing with the ss-tree. In: Proceedings of IEEE ICDE
32. Weber R, Schek HJ, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional space. In: Proceedings of VLDB
33. Yianilos P (1993) Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of ACM-SIAM symposium on discrete algorithms, pp 311-321
34. Yianilos P (1999) Excluded middle vantage point forests for nearest neighbor search. In: Implementation challenge, ALENEX'99