Approximate similarity search: a multi-faceted problem

DOI10.1016/j.jda.2008.09.014zbMath1162.68010OpenAlexW2026406865MaRDI QIDQ1013071

Marco Patella, Paolo Ciaccia

Publication date: 16 April 2009

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2008.09.014

zbMATH Keywords

similarity searchscheduling strategyapproximate queries

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Related Items (4)

Probabilistic proximity searching algorithms based on compact partitions ⋮ Distance-based index structures for fast similarity search ⋮ Index structures for fast similarity search for real vectors. II ⋮ Nearest neighbors methods for support vector machines

Cites Work

• Unnamed Item
• Unnamed Item
• Probabilistic proximity searching algorithms based on compact partitions
• Nearest neighbor queries in metric spaces
• Probabilistic proximity search: Fighting the curse of dimensionality in metric spaces.
• An optimal algorithm for approximate nearest neighbor searching fixed dimensions
• Statistical profile estimation in database systems
• Comparing Top k Lists
• On the differential simplicity of affine rings

This page was built for publication: Approximate similarity search: a multi-faceted problem