Speeding up spatial approximation search in metric spaces

DOI10.1145/1498698.1564506zbMath1284.68665OpenAlexW1967708363MaRDI QIDQ5406214

Edgar Chávez, Karina Figueroa, Rodrigo Paredes, Gonzalo Navarro

Publication date: 1 April 2014

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1498698.1564506

zbMATH Keywords

AESAproximity or similarity searching

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Approximation algorithms (68W25)

Related Items (2)

Distance-based index structures for fast similarity search ⋮ Characterizing the optimal pivots for efficient similarity searches in vector space databases with Minkowski distances

This page was built for publication: Speeding up spatial approximation search in metric spaces