Selecting Sketches for Similarity Search

DOI10.1007/978-3-319-98398-1_9MaRDI QIDQ6104437zbMATH OpenOpenAlexFDO

Authors David C. Novak, Pavel Zezula

Publication date 28 June 2023

Published in Advances in Databases and Information Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-98398-1_9

zbMATH Keywords

binomial analogueHamming embeddingHamming spacepivot pairsketching techniques

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15)

Recommendations

• Real-valued embeddings and sketches for fast distance and similarity estimation
• Index structures for fast similarity search for binary vectors
• Index structures for fast similarity search for real-valued vectors. I
• Similarity search. The metric space approach.
• Distance-based index structures for fast similarity search

Cites work

• Foundations of multidimensional and metric data structures.
• Similarity estimation techniques from rounding algorithms
• Similarity search. The metric space approach.

Cited in

(3)

• Efficient binary embedding of categorical data using BinSketch
• A sketch algorithm for estimating two-way and multi-way associations
• Real-valued embeddings and sketches for fast distance and similarity estimation

This page was built for publication: Selecting Sketches for Similarity Search

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