Database Paper Browser

Back to papers

Revisiting Pipelined Parallelism in Multi-Join Query Processing

Summary: Challenging the assumption that maximal pipelined parallelism is best for multi-join processing. Proposes segmented bushy processing that blends parallelism forms, achieving about 50% faster total processing than state-of-the-art on a real cluster. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9361
Venue
VLDB
Year
2005
Pagerank
5.1074949e-05
Overall Rank
6,322 | 56.07%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank Citing Paper Year Venue Pagerank
771 Relational Joins on Graphics Processors 2008 SIGMOD 0.00016813054
7,491 Krypton: Real-time Serving and Analytical SQL Engine at ByteDance 2023 VLDB 4.7135369e-05
9,083 A Dynamically Adaptive Distributed System for Processing Complex Continuous Queries 2005 VLDB 4.3951708e-05
9,939 Out-of-order Execution of Database Queries 2020 VLDB 4.2416883e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers