Parallel acyclic joins: optimal algorithms and cyclicity separation

DOI10.1145/3633512MaRDI QIDQ6939383zbMATH OpenFDO

Authors Xiao Hu, Yufei Tao

Publication date 21 August 2025

Published in Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

conjunctive queriesI/O-efficiencyjoinslower boundsmassively parallel computation

Mathematics Subject Classification ID

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

Cites work

• Communication steps for parallel query processing
• GYM: a multiround distributed join algorithm
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• scientific article; zbMATH DE number 7566062 (Why is no real title available?)
• scientific article; zbMATH DE number 7650999 (Why is no real title available?)
• scientific article; zbMATH DE number 7651003 (Why is no real title available?)
• Joins via geometric resolutions. Worst case and beyond
• Massively parallel entity matching with linear classification in low dimensional space
• Output-optimal massively parallel algorithms for similarity joins
• Parallel acyclic joins with canonical edge covers
• Size bounds and query plans for relational joins
• The complexity of acyclic conjunctive queries
• Worst-case optimal algorithms for parallel query processing
• Worst-case optimal join algorithms

Cited in

(2)

• Hardness and algorithms for several new optimization problems on the weighted massively parallel computation model
• Parallel query processing with heterogeneous machines

This page was built for publication: Parallel acyclic joins: optimal algorithms and cyclicity separation

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