Exploiting distance coherence to speed up range queries in metric indexes

DOI10.1016/J.IPL.2005.03.007zbMath1182.68055OpenAlexW2103592863MaRDI QIDQ1041769

Kimmo Fredriksson

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.03.007

zbMATH Keywords

algorithmsinformation retrievaldata structuresmetric space indexingproximity searchingsimilar range queries

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• Unnamed Item
• Satisfying general proximity/similarity queries with metric trees
• Some approaches to best-match file searching
• A Data Structure and an Algorithm for the Nearest Point Problem
• Algorithms for approximate string matching
• Pivot selection techniques for proximity searching in metric spaces

This page was built for publication: Exploiting distance coherence to speed up range queries in metric indexes