DBScholar

Back to papers

A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing

Summary: Seven-dimensional hashing study shows that scheme, function, and layout choices dramatically affect inserts and lookups. Analyzing 20 combinations across five data-distribution factors plus two extra axes (hash schemes and hash functions), with memory layout and SIMD effects, yields practical white-box guidelines on when to use which hashing method. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
hece4db05fe5e8f19
Venue
VLDB
Year
2016
Pagerank
0.00011492443
Overall Rank
1,213 | 91.88%
DOI
10.14778/2850583.2850587
PDF
Download (CC BY-NC-ND 4.0)

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{richter_vldb16,
        title = {{A Seven-Dimensional Analysis of Hashing Methods and its Implications on Query Processing}},
        author = {Richter, Stefan and Alvarez, Victor and Dittrich, Jens},
        journal = {PVLDB},
        series = {{VLDB} '16},
        volume = {9},
        number = {3},
        pages = {96--107},
        doi = {10.14778/2850583.2850587},
        url = {https://doi.org/10.14778/2850583.2850587},
        year = {2016}
}

Incoming Citations (Sorted by Pagerank)

Showing 28 of 28 citing papers.

Rank Citing Paper Year Venue Pagerank
40 The Case for Learned Index Structures 2018 SIGMOD 0.00046249672
834 Benchmarking Learned Indexes 2021 VLDB 0.00013539098
1,269 An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory 2016 SIGMOD 0.00011236561
1,350 Relaxed Operator Fusion for In-Memory Databases: Making Compilation, Vectorization, and Prefetching Work Together At Last 2018 VLDB 0.00010934877
2,827 To Partition, or Not to Partition, That is the Join Question in a Real System 2021 SIGMOD 7.9486247e-05
3,364 RUMA has it: Rewired User-space Memory Access is Possible! 2016 VLDB 7.3560582e-05
3,622 Triton Join: Efficiently Scaling to a Large Join State on GPUs with Fast Interconnects 2022 SIGMOD 7.1350619e-05
4,915 Can Learned Models Replace Hash Functions? 2023 VLDB 6.3452789e-05
4,958 FPGA-based Data Partitioning 2017 SIGMOD 6.3254925e-05
5,169 The 3D Hash Join: Building On Non-Unique Join Attributes 2022 CIDR 6.2335575e-05
5,564 Charting the Design Space of Query Execution using VOILA 2021 VLDB 6.0660209e-05
6,228 Data Partitioning for In-Memory Systems: Myths, Challenges, and Opportunities 2019 CIDR 5.8261473e-05
6,640 SKT: A One-Pass Multi-Sketch Data Analytics Accelerator 2021 VLDB 5.7085404e-05
7,051 The Case for Deep Query Optimisation 2020 CIDR 5.5964667e-05
7,122 Design and Analysis of a Processing-in-DIMM Join Algorithm: A Case Study with UPMEM DIMMs 2023 SIGMOD 5.580601e-05
7,439 Is Perfect Hashing Practical for OLAP Systems? 2024 CIDR 5.5122587e-05
7,496 Fast Detection of Denial Constraint Violations 2022 VLDB 5.4968024e-05
7,727 The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures 2022 VLDB 5.4518367e-05
7,822 Analyzing Vectorized Hash Tables Across CPU Architectures 2023 VLDB 5.4304761e-05
7,996 Rethinking Stateful Stream Processing with RDMA 2022 SIGMOD 5.3941543e-05
9,034 Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity 2022 SIGMOD 5.219451e-05
9,164 Taking the Shortcut: Actively Incorporating the Virtual Memory Index of the OS to Hardware-Accelerate Database Indexing 2024 CIDR 5.2034392e-05
9,337 VIP Hashing - Adapting to Skew in Popularity of Data on the Fly 2022 VLDB 5.1783355e-05
9,907 Zombie Hashing: Reanimating Tombstones in a Graveyard 2025 SIGMOD 5.0983269e-05
10,183 A four-dimensional Analysis of Partitioned Approximate Filters 2021 VLDB 5.0544167e-05
10,249 Turbo-Charging SPJ Query Plans with Learned Physical Join Operator Selections 2022 VLDB 5.0412674e-05
10,421 Prune Early, Intersect Fast: PRISM, a Prefix-based Radix Integer Set with Morphing Nodes 2027 VLDB 4.9605343e-05
10,748 RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage 2026 SIGMOD 4.9605343e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
280 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00022267903
965 Memory-Efficient Hash Joins 2015 VLDB 0.00012778081
Previous Page 1 / 1 Next

Semantically Similar Papers