Output-optimal massively parallel algorithms for similarity joins

DOI10.1145/3311967MaRDI QIDQ5012612zbMATH OpenOpenAlexWikidataFDO

Authors Xiao Hu, Ke Yi, Yufei Tao

Publication date 25 November 2021

Published in ACM Transactions on Database Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3311967

zbMATH Keywords

output-sensitive algorithmsparallel computationsimilarity joins

Mathematics Subject Classification ID

Database theory (68P15) Parallel algorithms in computer science (68W10)

Recommendations

• Optimizing top-\(k\) similarity join algorithm
• Worst-case optimal algorithms for parallel query processing
• Worst-case optimal join algorithms
• It's all a matter of degree. Using degree information to optimize multiway joins
• Algorithmic aspects of parallel data processing

Cited in

(10)

• It's all a matter of degree. Using degree information to optimize multiway joins
• I/O-efficient similarity join
• Massively-Parallel Similarity Join, Edge-Isoperimetry, and Distance Correlations on the Hypercube
• Algorithmic aspects of parallel data processing
• scientific article; zbMATH DE number 7566062 (Why is no real title available?)
• Worst-case optimal algorithms for parallel query processing
• It's all a matter of degree: using degree information to optimize multiway joins
• Optimizing top-\(k\) similarity join algorithm
• scientific article; zbMATH DE number 7651003 (Why is no real title available?)
• Parallel acyclic joins: optimal algorithms and cyclicity separation

This page was built for publication: Output-optimal massively parallel algorithms for similarity joins

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