The Many Facets of Approximate Similarity Search

Authors:
Marco Patella;Paolo Ciaccia
Affiliations:
-;-
Venue:
SISAP '08 Proceedings of the First International Workshop on Similarity Search and Applications (sisap 2008)
Year:
2008

Citing 0
Cited 7

Approximate similarity search: A multi-faceted problem

Journal of Discrete Algorithms
Approximate Retrieval with HiPeR: Application to VA-Hierarchies

MMM '09 Proceedings of the 15th International Multimedia Modeling Conference on Advances in Multimedia Modeling
Analyzing Metric Space Indexes: What For?

SISAP '09 Proceedings of the 2009 Second International Workshop on Similarity Search and Applications
Indexability, concentration, and VC theory

Proceedings of the Third International Conference on SImilarity Search and APplications
Approximate and probabilistic methods

SIGSPATIAL Special
Metric Index: An efficient and scalable solution for precise and approximate similarity search

Information Systems
Indexability, concentration, and VC theory

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 optimal-on-the-average schedules are well-defined. We complete by critically reviewing methods for evaluating the quality of approximate results.