An index data structure for searching in metric space databases

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

Volumn 3991 LNCS - I, Issue , 2006, Pages 611-617

  Uribe, Roberto ^a   Navarro, Gonzalo ^b   Barrientos, Ricardo J ^a   Marín, Mauricio ^a,c  

^a UNIVERSIDAD DE MAGALLANES   (Chile)

^b UNIVERSITY OF CHILE   (Chile)

^c Centre for Quaternary Research Punta Arenas   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; DATA STRUCTURES; PARALLEL PROCESSING SYSTEMS; TREES (MATHEMATICS);

EMPIRICAL RESULTS; EVOLUTIONARY GEOMETRIC NEAR-NEIGHBOR ACCESS TREE (EGNAT); HIGH-DIMENSIONAL METRIC SPACES; PARALLELIZATION;

DATABASE SYSTEMS;

EID: 33746630152     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11758501_82     Document Type: Conference Paper

References (12)

1. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixedqueries trees. In 5th Combinatorial Pattern Matching (CPM'94), LNCS 807, pages 198-212, 1994.
2. Sergei Brin. Near neighbor search in large metric spaces. In the 21st VLDB Conference, pages 574-584. Morgan Kaufmann Publishers, 1995,
3. W. Burkhard and R. Keller. Some approaches to best-match file searching. Communication of ACM, 16(4):230-236, 1973.
4. Edgar Chvez, Gonzalo Navarro, Ricardo Baeza-Yates, and Jos L. Marroqun. Searching in metric spaces. In ACM Computing Surveys, pages 33(3):273-321, September 2001.
5. P. Ciaccia, M. Patella, and P. Zezula. M-tree: An efficient access method for similarity search in metric spaces. In the 23st International Conference on VLDB, pages 426-435, 1997.
6. Gonzalo Navarro. Searching in metric spaces by spatial approximation. The Very Large Databases Journal (VLDBJ), 11(1):28-46, 2002.
7. Gonzalo Navarro and Nora Reyes. Fully dynamic spatial approximation trees. In the 9th International Symposium on String Processing and Information Retrieval (SPIRE 2002), pages 254-270, Springer 2002.
8. Caetano Traina, Agma Traina, Bernhard Seeger, and Christos Faloutsos. Slimtrees: High performance metric trees minimizing overlap between nodes. In VII International Conference on Extending Database Technology, pages 51-61, 2000.
9. J. Uhlmann. Satisfying general proximity/similarity queries with metric trees. In Information Processing Letters, pages 40:175-179, 1991.
10. R. Uribe. A space-metric data structure for secondary memory. Master's thesis, Computer Science Department, University of Chile, Santiago, Chile, Abril 2005.
11. L.G. Valiant. A bridging model for parallel computation. Comm. ACM, 33:103-111, Aug. 1990.
12. P. Yianilos. Data structures and algoritms for nearest neighbor search in general metric spaces. In 4th ACM-SIAM Symposium on Discrete Algorithms (SODA '93), pages 311-321, 1993.