SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries
Summary: SPRINTER: fast n-ary join processing for OLAP queries with FK-FK joins. A cost-based plan avoids intermediate results and reduces probes; integrates with an open-source in-memory OLAP system and achieves best-in-class performance on TPC-DS. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Yoon-Min Nam (Daegu Gyeongbuk Institute of Science and Technology)
- 2. Donghyoung Han (Daegu Gyeongbuk Institute of Science and Technology)
- 3. Min-Soo Kim (Korea Advanced Institute of Science and Technology)
BibTeX Citation
@inproceedings{nam_sigmod20,
title = {{SPRINTER: A Fast n-ary Join Query Processing Method for Complex OLAP Queries}},
author = {Nam, Yoon-Min and Han, Donghyoung and Kim, Min-Soo},
series = {{SIGMOD} '20},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3318464.3380565},
url = {https://dl.acm.org/doi/10.1145/3318464.3380565},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 4 of 4 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,122 | Cardinality Estimation in DBMS: A Comprehensive Benchmark Evaluation | 2022 | VLDB | 0.0001209124 |
| 8,904 | A Design Space Exploration and Evaluation for Main-Memory Hash Joins in Storage Class Memory | 2023 | VLDB | 5.3483178e-05 |
| 9,478 | Parallel Query Processing: To Separate Communication from Computation | 2022 | SIGMOD | 5.2634238e-05 |
| 10,787 | cuMatch: A GPU-based Memory-Efficient Worst-case Optimal Join Processing Method for Subgraph Queries with Complex Patterns | 2025 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 33 of 33 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
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,885 | Fast Matrix Multiplication for Query Processing | 2024 | PODS |
| 2 | 8,721 | Accelerate Distributed Joins with Predicate Transfer | 2025 | SIGMOD |
| 3 | 3,622 | Robust Join Processing with Diamond Hardened Joins | 2024 | VLDB |
| 4 | 2,104 | Optimization of Multi-Way Join Queries for Parallel Execution | 1991 | VLDB |
| 5 | 1,286 | Adaptive Optimization of Very Large Join Queries | 2018 | SIGMOD |
| 6 | 11,200 | High-Performance Query Processing with NVMe Arrays: Spilling without Killing Performance | 2024 | SIGMOD |
| 7 | 1,022 | A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses | 2009 | VLDB |
| 8 | 11,625 | Accelerating Complex Analytics using Speculation | 2021 | CIDR |
| 9 | 8,625 | QPPT: Query Processing on Prefix Trees | 2013 | CIDR |
| 10 | 136 | Join Synopses for Approximate Query Answering | 1999 | SIGMOD |