Index-based, high-dimensional, cosine threshold querying with optimality guarantees

DOI10.4230/LIPICS.ICDT.2019.11MaRDI QIDQ5091121zbMATH OpenFDO

Authors

Publication date 21 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2019.11

zbMATH Keywords

cosinesimilarity searchthreshold algorithmvector databases

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Index-based, high-dimensional, cosine threshold querying with optimality guarantees
• Using non-zero dimensions for the cosine and Tanimoto similarity search among real valued vectors
• Index structures for fast similarity search for real-valued vectors. I
• Approximate similarity search: a multi-faceted problem
• Similarity search in high-dimensional vector spaces (Thesis, ETH Zürich 2000)

Cites work

• Computational geometry. Algorithms and applications.
• Exact and approximate maximum inner product search with LEMP
• Foundations of multidimensional and metric data structures.
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Optimal aggregation algorithms for middleware.

Cited in

(1)

• Index-based, high-dimensional, cosine threshold querying with optimality guarantees

This page was built for publication: Index-based, high-dimensional, cosine threshold querying with optimality guarantees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091121)