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
11570
Venue
VLDB
Year
2016
Pagerank
0.00011362007
Overall Rank
1,278 | 91.24%
DOI
10.14778/2850583.2850587

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 27 of 27 citing papers.

Rank Citing Paper Year Venue Pagerank
43 The Case for Learned Index Structures 2018 SIGMOD 0.00046060254
847 Benchmarking Learned Indexes 2021 VLDB 0.0001365768
1,265 An Experimental Comparison of Thirteen Relational Equi-Joins in Main Memory 2016 SIGMOD 0.00011415709
1,379 Relaxed Operator Fusion for In-Memory Databases: Making Compilation, Vectorization, and Prefetching Work Together At Last 2018 VLDB 0.00010970894
2,962 To Partition, or Not to Partition, That is the Join Question in a Real System 2021 SIGMOD 7.9170451e-05
3,344 RUMA has it: Rewired User-space Memory Access is Possible! 2016 VLDB 7.4980897e-05
4,535 Triton Join: Efficiently Scaling to a Large Join State on GPUs with Fast Interconnects 2022 SIGMOD 6.6419266e-05
4,780 Can Learned Models Replace Hash Functions? 2023 VLDB 6.5118885e-05
4,840 FPGA-based Data Partitioning 2017 SIGMOD 6.483442e-05
5,765 Charting the Design Space of Query Execution using VOILA 2021 VLDB 6.0953705e-05
6,161 Data Partitioning for In-Memory Systems: Myths, Challenges, and Opportunities 2019 CIDR 5.9537202e-05
6,207 The 3D Hash Join: Building On Non-Unique Join Attributes 2022 CIDR 5.9429869e-05
6,957 Design and Analysis of a Processing-in-DIMM Join Algorithm: A Case Study with UPMEM DIMMs 2023 SIGMOD 5.7303405e-05
7,069 SKT: A One-Pass Multi-Sketch Data Analytics Accelerator 2021 VLDB 5.7117595e-05
7,156 The Case for Deep Query Optimisation 2020 CIDR 5.686096e-05
7,287 Is Perfect Hashing Practical for OLAP Systems? 2024 CIDR 5.6544795e-05
7,396 Fast Detection of Denial Constraint Violations 2022 VLDB 5.6257228e-05
7,768 The next 50 Years in Database Indexing or: The Case for Automatically Generated Index Structures 2022 VLDB 5.5475685e-05
7,814 Rethinking Stateful Stream Processing with RDMA 2022 SIGMOD 5.5389009e-05
8,443 Analyzing Vectorized Hash Tables Across CPU Architectures 2023 VLDB 5.4243766e-05
8,880 Entropy-Learned Hashing: Constant Time Hashing with Controllable Uniformity 2022 SIGMOD 5.3524255e-05
8,989 Taking the Shortcut: Actively Incorporating the Virtual Memory Index of the OS to Hardware-Accelerate Database Indexing 2024 CIDR 5.3383769e-05
10,004 A four-dimensional Analysis of Partitioned Approximate Filters 2021 VLDB 5.1810297e-05
10,016 Turbo-Charging SPJ Query Plans with Learned Physical Join Operator Selections 2022 VLDB 5.1764556e-05
10,025 VIP Hashing - Adapting to Skew in Popularity of Data on the Fly 2022 VLDB 5.1757914e-05
10,489 RadixGraph: A Fast, Space-Optimized Data Structure for Dynamic Graph Storage 2026 SIGMOD 5.093636e-05
10,799 Zombie Hashing: Reanimating Tombstones in a Graveyard 2025 SIGMOD 5.093636e-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
278 FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs 2010 SIGMOD 0.00022476841
959 Memory-Efficient Hash Joins 2015 VLDB 0.00012953588
Previous Page 1 / 1 Next

Semantically Similar Papers

# Overall Rank Paper Year Venue
1 8,443 Analyzing Vectorized Hash Tables Across CPU Architectures 2023 VLDB
2 2,250 Cache-Efficient Aggregation: Hashing Is Sorting 2015 SIGMOD
3 2,801 Concurrency and Linear Hashing 1985 PODS
4 8,995 Hashing in Practice, Analysis of Hashing and Universal Hashing 1988 SIGMOD
5 7,287 Is Perfect Hashing Practical for OLAP Systems? 2024 CIDR
6 904 Tradeoffs in Processing Complex Join Queries via Hashing in Multiprocessor Database Machines 1990 VLDB
7 360 Design and Evaluation of Main Memory Hash Join Algorithms for Multi-core CPUs 2011 SIGMOD
8 13,087 Fast Search In Main Memory Databases 1992 SIGMOD
9 21 Similarity Search in High Dimensions via Hashing 1999 VLDB
10 4,780 Can Learned Models Replace Hash Functions? 2023 VLDB