Approximate similarity search: A multi-faceted problem

@article{Patella2009ApproximateSS,
  title={Approximate similarity search: A multi-faceted problem},
  author={Marco Patella and Paolo Ciaccia},
  journal={J. Discrete Algorithms},
  year={2009},
  volume={7},
  pages={36-48}
}
a r t i c l e i n f o a b s t r a c t 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… CONTINUE READING
Highly Cited
This paper has 52 citations. REVIEW CITATIONS
27 Citations
46 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 27 extracted citations

53 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 46 references

Similar Papers

Loading similar papers…