The Many Facets of Approximate Similarity Search

In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along several independent coordinates. Then, we discuss the impact that scheduling of index nodes can have on performance and show that, unlike exact similarity queries, no provable optimal scheduling strategy exists for approximate queries. On the positive side, we show that optimalon-the-average schedules are well-defined. We complete by critically reviewing methods for evaluating the quality of approximate results.

• Type: Conference
• Year: 2008
• Where: SISAP
• Authors: Marco Patella, Paolo Ciaccia
• Keywords: Approximate Queries, Approximate Similarity Queries, Data Mining, Provable Optimal Scheduling, SISAP 2008