Faster proximity searching in metric data

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2972, Issue , 2004, Pages 222-231

  Chávez, Edgar ^a   Figueroa, Karina ^a,b  

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

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FUNCTIONS; INDEXING (OF INFORMATION); MULTIMEDIA SYSTEMS; PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; DIGITAL STORAGE; QUERY LANGUAGES;

CLUSTERING; KERNEL METHODS; MULTIMEDIA INDEXING; QUERY COMPLEXITY; CONSTRUCTION TIME; INDEXING ALGORITHMS; METRIC DATABASE; PROXIMITY QUERIES; PROXIMITY SEARCHING;

QUERY LANGUAGES; QUERY PROCESSING;

EID: 9444225486     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-24694-7_23     Document Type: Conference Paper

References (10)

1. R. Baeza-Yates. Searching: an algorithmic tour. In A. Kent and J. Williams, editors, Encyclopedia of Computer Science and Technology, volume 37, pages 331-359. Marcel Dekker Inc., 1997.
2. R. Baeza-Yates, W. Cunto, U. Manber, and S. Wu. Proximity matching using fixed-queries trees. In Proc. 5th Combinatorial Pattern Matching (CPM'94), LNCS 807, pages 198-212, 1994.
3. R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley, 1999.
4. W. Burkhard and R. Keller. Some approaches to best-match file searching. Comm. of the ACM, 16(4):230-236, 1973.
5. Edgar Chávez, José Luis Marroquín, and Gonzalo Navarro. Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications (MTAP), 14(2):113-135, 2001.
6. Edgar Chávez, Gonzalo Navarro, Ricardo Baeza-Yates, and José Luis Marroquín. Proximity searching in metric spaces. ACM Computing Surveys, 33(3):273-321, September 2001.
7. Mark Derthick, James Harrison, Andrew Moore, and Steven Roth. Efficient multiobject dynamic query histograms. In Proceedings of the IEEE Symposium on Information Visualization, pages 84-91. IEEE Press, 1999.
8. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. ACM SIGMOD International Conference on Management of Data, pages 47-57, 1984.
9. L. Micó, J. Oncina, and E. Vidal. A new version of the nearest-neighbor approximating and eliminating search (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters, 15:9-17, 1994.
10. P. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In Proc. 4th ACM-SIAM Symposium on Discrete Algorithms (SODA'93), pages 311-321, 1993.