I/O-efficient similarity join

DOI10.1007/S00453-017-0285-5zbMath1372.68082OpenAlexW1901393228MaRDI QIDQ2408174

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

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

locality sensitive hashingcache oblivioussimilarity joincache aware

Mathematics Subject Classification ID

Database theory (68P15)

Cites Work

• Unnamed Item
• Unnamed Item
• Locality-Sensitive Hashing Without False Negatives for $$l_p$$
• Algorithms and Data Structures for External Memory
• Cache-Oblivious Algorithms
• I/O-Efficient Similarity Join
• Similarity estimation techniques from rounding algorithms
• Locality-sensitive Hashing without False Negatives
• Locality-sensitive hashing scheme based on p-stable distributions
• Concentration of Measure for the Analysis of Randomized Algorithms

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