Efficient Hash Probes on Modern Processors
@article{Ross2007EfficientHP, title={Efficient Hash Probes on Modern Processors}, author={K. Ross}, journal={2007 IEEE 23rd International Conference on Data Engineering}, year={2007}, pages={1297-1301} }
Bucketized versions of Cuckoo hashing can achieve 95-99% occupancy, without any space overhead for pointers or other structures. [...] Key Method We show how to improve probe performance by (a) eliminating branch instructions from the probe code, enabling better scheduling and latency-hiding by modern processors, and (b) using SIMD instructions to process multiple keys/payloads in parallel. We show that on modern architectures, probes to a bucketized Cuckoo hash table can be processed much faster than…Expand Abstract
83 Citations
High throughput heavy hitter aggregation for modern SIMD processors
- Computer Science
- DaMoN '13
- 2013
- 32
- PDF
Cuckoo++ hash tables: high-performance hash tables for networking applications
- Computer Science
- ANCS
- 2018
- 15
- PDF
Horton Tables: Fast Hash Tables for In-Memory Data-Intensive Computing
- Computer Science
- USENIX Annual Technical Conference
- 2016
- 28
- Highly Influenced
- PDF
HASHI: An Application Specific Instruction Set Extension for Hashing
- Computer Science
- ADMS@VLDB
- 2014
- 13
- PDF
Design and evaluation of main memory hash join algorithms for multi-core CPUs
- Computer Science
- SIGMOD '11
- 2011
- 208
- PDF
References
SHOWING 1-10 OF 22 REFERENCES
Space Efficient Hash Tables with Worst Case Constant Access Time
- Mathematics, Computer Science
- Theory of Computing Systems
- 2004
- 121
- PDF
Improving Database Performance on Simultaneous Multithreading Processors
- Computer Science
- VLDB
- 2005
- 96
- PDF
Balanced Allocation and Dictionaries with Tightly Packed Constant Size Bins
- Mathematics, Computer Science
- ICALP
- 2005
- 93
- PDF
A Reliable Randomized Algorithm for the Closest-Pair Problem
- Mathematics, Computer Science
- J. Algorithms
- 1997
- 205
- PDF