scientific article; zbMATH DE number 7566062

MaRDI QIDQ5094134

Yufei Tao, Dan Suciu, Bas Ketsman

Publication date: 2 August 2022

Full work available at URL: https://arxiv.org/abs/2011.14482

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

database theoryparallel computingjoinsconjunctive queries

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Uses Software

• MapReduce

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration
• Private vs. common random bits in communication complexity
• Size Bounds and Query Plans for Relational Joins
• Communication-Efficient Parallel Sorting
• Worst-case Optimal Join Algorithms
• Algorithmic Aspects of Parallel Data Processing
• Communication Steps for Parallel Query Processing
• Output-Optimal Massively Parallel Algorithms for Similarity Joins
• The complexity of theorem-proving procedures

This page was built for publication: