Fixed queries array: A fast and economical data structure for proximity searching

DOI10.1023/A:1011343115154zbMath1035.68578OpenAlexW1592473003MaRDI QIDQ1857244

Gonzalo Navarro, Edgar Chávez, José L. Marroquín

Publication date: 17 February 2003

Published in: Multimedia Tools and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011343115154

zbMATH Keywords

metric spacessimilarity searchrange searchfixed queries tree

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10) Computing methodologies and applications (68U99) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (4)

Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances ⋮ Parallel query processing on distributed clustering indexes ⋮ Solving similarity joins and range queries in metric spaces with the list of twin clusters ⋮ Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.

This page was built for publication: Fixed queries array: A fast and economical data structure for proximity searching