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: 469
Venue: CIDR
Year: 2022
Pagerank: 5.2449175e-05
Overall Rank: 9,612 | 34.06%
DOI: 10.1145/1122445.1122456

Incoming Non-self Citations Over Time

Authors

1. Lukas Landgraf (Technical University of Dresden)
2. Florian Wolf (SAP)
3. Alexander Boehm (SAP)
4. Wolfgang Lehner (Technical University of Dresden)

BibTeX Citation

@inproceedings{landgraf_cidr22,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '22},
        title = {{Memory Efficient Scheduling of Query Pipeline Execution}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Landgraf, Lukas and Wolf, Florian and Boehm, Alexander and Lehner, Wolfgang},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,007	Experimental Evaluation of Optimizing Memory Consumption in SAP HANA Using PEOopt	2025	SIGMOD	5.3338237e-05
10,106	How to Optimize SQL Queries? A Comparison Between Split, Holistic, and Hybrid Approaches	2025	VLDB	5.1435736e-05
11,358	Pipeline Group Optimization on Disaggregated Systems	2023	CIDR	5.093636e-05

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.

Rank	Cited Paper	Year	Venue	Pagerank
14	MonetDB/X100: Hyper-Pipelining Query Execution	2005	CIDR	0.0006312782
23	Efficiently Compiling Efficient Query Plans for Modern Hardware	2011	VLDB	0.00054886415
241	Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age	2014	SIGMOD	0.00023654664
492	Robust Query Processing through Progressive Optimization	2004	SIGMOD	0.0001756877
563	Plan-Structured Deep Neural Network Models for Query Performance Prediction	2019	VLDB	0.0001650812
1,027	Chain: Operator Scheduling for Memory Minimization in Data Stream Systems	2003	SIGMOD	0.00012563656
3,482	Towards Predicting Query Execution Time for Concurrent and Dynamic Database Workloads	2013	VLDB	7.3751635e-05
4,335	Adaptive HTAP through Elastic Resource Scheduling	2020	SIGMOD	6.7556868e-05
6,019	Robustness Metrics for Relational Query Execution Plans	2018	VLDB	6.0060149e-05
7,495	On the Calculation of Optimality Ranges for Relational Query Execution Plans	2018	SIGMOD	5.6041473e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	5,536	Database Processing-in-Memory: An Experimental Study	2020	VLDB
2	2,131	Optimization Algorithms for Exploiting the Parallelism-Communication Tradeoff in Pipelined Parallelism	1994	VLDB
3	1,720	Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins	1992	VLDB
4	4,305	Reordering Query Execution in Tertiary Memory Databases	1996	VLDB
5	6,009	Optimization of Conjunctive Predicates for Main Memory Column Stores	2016	VLDB
6	1,763	Dynamic Pipeline Scheduling for Improving Interactive Query Performance	2001	VLDB
7	1,027	Chain: Operator Scheduling for Memory Minimization in Data Stream Systems	2003	SIGMOD
8	11,358	Pipeline Group Optimization on Disaggregated Systems	2023	CIDR
9	6,255	Elastic Pipelining in an In-Memory Database Cluster	2016	SIGMOD
10	822	Pipelining in Multi-Query Optimization	2001	PODS