Priority vantage points structures for similarity queries in metric spaces

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2510 LNCS, Issue , 2002, Pages 256-263

  Celik, Cengiz ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL STORAGE; QUERY PROCESSING; TOPOLOGY;

CONSTRUCTION COSTS; DISTANCE COMPUTATION; PERFORMANCE CHARACTERISTICS; QUERY PERFORMANCE; SIMILARITY QUERY; SIMILARITY SEARCH; SPACE CONSUMPTION; SPACE REQUIREMENTS;

SET THEORY;

EID: 44249086382     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36087-5_30     Document Type: Conference Paper

References (13)

1. C. Traina Jr., Agma J. M. Traina, B. Seeger, C. Faloutsos. Slim-Trees: High Performance Metric Trees Minimizing Overlap Between Nodes. EDBT: 51-65. 2000.
2. E. Chávez, J. L. Marroquín, R. A. Baeza-Yates. Spaghettis: An Array Based Algorithm for Similarity Queries in Metric Spaces. SPIRE/CRIWG: 38-46. 1999.
3. E. Chávez, G. Navarro, R. Baeza-Yates, J. L. Marroquín. Proximity Searching in Metric Spaces. ACM Computing Surveys 33(3):273-321. 2001a.
4. E. Chávez, J. L. Marroquín, G. Navarro. Fixed Queries Array: A Fast and Economical Data Structure for Proximity Searching. Multimedia Tools and Applications 14(2): 113-135. 2001b.
5. E. Vidal. An Algorithm for Finding Nearest Neighbors in (approximately) Constant Average Time. Pattern Recognition Letters 4:145. 1986.
6. J. Uhlmann. Satisfying General Proximity/Similarity Queries with Metric Trees. Information Processing Letters 40:175-179. 1991.
7. L. Mico, J. Oncina, E. Vidal. A New Version of the Nearest-neighbor Approximating and Eliminating Search (AESA) with Linear Preprocessing Time and Memory Requirements. Pattern Recognition Letters 17:731-739. 1996.
8. P. Ciaccia, M. Patella, and P. Zezula, M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. Proceedings of the 23rd VLDB. 1997.
9. R.F. Sproull. Refinements to Nearest-Neighbor Searching in k-Dimensional Trees. Algorith-mica 6:579-589. 1991.
10. S. Brin. Near Neighbor Search in Large Metric Spaces. Proc. VLDB 574-584. 1995.
11. S. Nene, S. Nayar. A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence 19(9):989-1003. 1997.
12. T. Bozkaya, M. Ozsoyoglu. Distance-based Indexing for High-dimensional Metric Spaces. SIGMOD 357-368. 1997.
13. W. Burkhard, R. Keller. Some Approaches to Best-Match File Searching. CACM 16(4): 230-236. 1973.