Indexing schemes for similarity search: an illustrated paradigm

Details Indexing schemes for similarity search: an illustrated paradigm Indexing schemes for similarity search: an illustrated paradigm

2002-11-14

arxiv.org/abs/cs/0211018v2

Fundamenta Informaticae Vol. 70 (2006), No. 4, 367-385

Computer Science

Data Structures and Algorithms

19 pages, LaTeX with 8 figures, prepared using Fundamenta Informaticae style file

Scientific paper

We suggest a variation of the Hellerstein--Koutsoupias--Papadimitriou indexability model for datasets equipped with a similarity measure, with the aim of better understanding the structure of indexing schemes for similarity-based search and the geometry of similarity workloads. This in particular provides a unified approach to a great variety of schemes used to index into metric spaces and facilitates their transfer to more general similarity measures such as quasi-metrics. We discuss links between performance of indexing schemes and high-dimensional geometry. The concepts and results are illustrated on a very large concrete dataset of peptide fragments equipped with a biologically significant similarity measure.

Affiliated with

Also associated with

No associations

Rating

Indexing schemes for similarity search: an illustrated paradigm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Indexing schemes for similarity search: an illustrated paradigm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Indexing schemes for similarity search: an illustrated paradigm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-473529