Adaptive Factorization Using Linear-Chained Hash Tables

Summary: Adds adaptive factorized aggregations and runtime-chosen worst-case-optimal joins to DuckDB via a collision-free linear-chained hash table that enables efficient factorized/WCOJ execution. Decisions use on-the-fly sketches, heuristics, and ML to obtain stats from subqueries/Parquet, yielding near-optimal performance with explainable low-cost alternatives. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 547
Venue: CIDR
Year: 2025
Pagerank: 5.4612012e-05
Overall Rank: 8,232 | 43.53%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Paul Groß (Centrum Wiskunde & Informatica)
2. Daniel ten Wolde (Centrum Wiskunde & Informatica)
3. Peter Boncz (Centrum Wiskunde & Informatica)

BibTeX Citation

@inproceedings{gro_cidr25,
        address = {Amsterdam, Netherlands},
        series = {{CIDR} '25},
        title = {{Adaptive Factorization Using Linear-Chained Hash Tables}},
        booktitle = {Proceedings of the {Conference} on {Innovative} {Data} {Systems} {Research}},
        author = {Groß, Paul and Wolde, Daniel ten and Boncz, Peter},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,074	Parachute: Single-Pass Bi-Directional Information Passing	2025	VLDB	5.4929961e-05
11,012	ScaleCache: Scalable and Production-grade Buffer Management for Disk-based Database Systems	2025	VLDB	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 17 of 17 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
89	On the Propagation of Errors in the Size of Join Results	1991	SIGMOD	0.00035031529
103	DuckDB: an Embeddable Analytical Database	2019	SIGMOD	0.00034161428
241	Morsel-Driven Parallelism: A NUMA-Aware Query Evaluation Framework for the Many-Core Age	2014	SIGMOD	0.00023654664
264	The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing	2018	VLDB	0.00022980015
321	Worst-Case Optimal Join Algorithms: Techniques, Results, and Open Problems	2018	PODS	0.00021283186
422	Umbra: A Disk-Based System with In-Memory Performance	2020	CIDR	0.00018732744
1,740	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB	9.875587e-05
2,126	Kuzu* Graph Database Management System	2023	CIDR	9.1329991e-05
2,392	FDB: A Query Engine for Factorised Relational Databases	2012	VLDB	8.6404947e-05
3,018	The LDBC Social Network Benchmark: Business Intelligence Workload	2023	VLDB	7.8473755e-05
3,070	Accurate Summary-based Cardinality Estimation Through the Lens of Cardinality Estimation Graphs	2022	VLDB	7.7900444e-05
3,215	Every Row Counts: Combining Sketches and Sampling for Accurate Group-By Result Estimates	2019	CIDR	7.6324234e-05
3,357	Columnar Storage and List-based Processing for Graph Database Management Systems	2021	VLDB	7.4904874e-05
3,622	Robust Join Processing with Diamond Hardened Joins	2024	VLDB	7.2465862e-05
6,207	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR	5.9429869e-05
6,439	DuckPGQ: Bringing SQL/PGQ to DuckDB	2023	VLDB	5.8787285e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	8,688	Advancing Fact Attribution for Query Answering: Aggregate Queries and Novel Algorithms	2025	VLDB
2	12,386	Efficient Rank Join with Aggregation Constraints	2011	VLDB
3	6,207	The 3D Hash Join: Building On Non-Unique Join Attributes	2022	CIDR
4	5,443	Generalized Hash Teams for Join and Group-by	1999	VLDB
5	844	Hash-Partitioned Join Method Using Dynamic Destaging Strategy	1988	VLDB
6	7,286	Efficient Computation of Quantiles over Joins	2023	PODS
7	1,740	Adopting Worst-Case Optimal Joins in Relational Database Systems	2020	VLDB
8	4,780	Can Learned Models Replace Hash Functions?	2023	VLDB
9	10,888	Saving Private Hash Join	2025	VLDB
10	10,662	Data Chunk Compaction in Vectorized Execution	2025	SIGMOD