Database Paper Browser

Back to papers

Memory Efficient Scheduling of Query Pipeline Execution

Summary: Exploit ordering of pipeline executions between pipeline breakers to minimize peak memory usage, formalizing the scheduling problem and search space. Present a formal model and four optimal/heuristic algorithms, with a prototype and Join Order Benchmark results showing notable memory savings and low planning overhead. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
470
Venue
CIDR
Year
2022
Pagerank
4.3355852e-05
Overall Rank
9,464 | 34.17%
DOI
10.1145/1122445.1122456

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 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