On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning
Summary: A systematic study isolates the performance effects of buffering, non-temporal stores, prefetching, memory layout, and page size in radix partitioning. It shows that seemingly simple optimizations interact in non-obvious ways, yielding practical guidance on when each pays off. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Felix Martin Schuhknecht (Saarland University)
- 2. Pankaj Khanchandani (Saarland University)
- 3. Jens Dittrich (Saarland University)
BibTeX Citation
@article{schuhknecht_vldb15,
title = {{On the Surprising Difficulty of Simple Things: the Case of Radix Partitioning}},
author = {Schuhknecht, Felix Martin and Khanchandani, Pankaj and Dittrich, Jens},
journal = {PVLDB},
series = {{VLDB} '15},
volume = {8},
number = {9},
pages = {934--945},
doi = {10.14778/2777598.2777602},
url = {https://doi.org/10.14778/2777598.2777602},
year = {2015}
}
Incoming Citations (Sorted by Pagerank)
Showing 11 of 11 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 29 | Database Architecture Optimized for the New Bottleneck: Memory Access | 1999 | VLDB | 0.00052093615 |
| 252 | Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited | 2014 | VLDB | 0.00023242719 |
| 678 | Fast Sort on CPUs and GPUs: A Case for Bandwidth Oblivious SIMD Sort | 2010 | SIGMOD | 0.00015061068 |
| 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD | 0.00011808761 |
| 2,378 | The Uncracked Pieces in Database Cracking | 2014 | VLDB | 8.6682285e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,278 | A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing | 2016 | VLDB |
| 2 | 1,508 | Sorting And Indexing With Partitioned B-Trees | 2003 | CIDR |
| 3 | 6,547 | Optimal Splitters for Temporal and Multi-version Databases | 2013 | SIGMOD |
| 4 | 2,667 | A Memory Bandwidth-Efficient Hybrid Radix Sort on GPUs | 2017 | SIGMOD |
| 5 | 10,004 | A four-dimensional Analysis of Partitioned Approximate Filters | 2021 | VLDB |
| 6 | 2,962 | To Partition, or Not to Partition, That is the Join Question in a Real System | 2021 | SIGMOD |
| 7 | 11,632 | Data-Independent Space Partitionings for Summaries | 2021 | PODS |
| 8 | 12,191 | A Partitioning Framework for Aggressive Data Skipping | 2014 | VLDB |
| 9 | 6,161 | Data Partitioning for In-Memory Systems: Myths, Challenges, and Opportunities | 2019 | CIDR |
| 10 | 1,177 | A Comprehensive Study of Main-Memory Partitioning and its Application to Large-Scale Comparison- and Radix-Sort | 2014 | SIGMOD |