Sciweavers

Share
SISAP
2008
IEEE

The Many Facets of Approximate Similarity Search

10 years 6 months ago
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.
Marco Patella, Paolo Ciaccia
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where SISAP
Authors Marco Patella, Paolo Ciaccia
Comments (0)
books