I/O-efficient similarity join

DOI10.1007/S00453-017-0285-5MaRDI QIDQ2408174zbMATH OpenOpenAlexFDO

Authors Rasmus Pagh, Ninh Pham, Francesco Silvestri, Morten Stöckel

Publication date 10 October 2017

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://curis.ku.dk/portal/da/publications/ioefficient-similarity-join(d4414b0d-bde7-4eab-9f13-2b3ef0c3eb6c).html

zbMATH Keywords

cache awarecache obliviouslocality sensitive hashingsimilarity join

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• Efficient SimRank-based similarity join
• A near-optimal similarity join algorithm and performance evaluation
• Output-optimal massively parallel algorithms for similarity joins
• Optimizing top-\(k\) similarity join algorithm

Cites work

• Algorithms and data structures for external memory
• Cache-oblivious algorithms
• Concentration of Measure for the Analysis of Randomized Algorithms
• scientific article; zbMATH DE number 2001586 (Why is no real title available?)
• scientific article; zbMATH DE number 1775450 (Why is no real title available?)
• I/O-efficient similarity join
• Locality-sensitive hashing scheme based on p-stable distributions
• Locality-sensitive hashing without false negatives
• Locality-Sensitive Hashing Without False Negatives for l_p
• Similarity estimation techniques from rounding algorithms

Cited in

(5)

• I/O-efficient similarity join
• Large-scale similarity joins with guarantees (invited talk)
• A near-optimal similarity join algorithm and performance evaluation
• scientific article; zbMATH DE number 7650999 (Why is no real title available?)
• Approximate similarity search under edit distance using locality-sensitive hashing

This page was built for publication: I/O-efficient similarity join

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