Iceberg Hashing: Optimizing Many Hash-Table Criteria at Once
Despite being one of the oldest data structures in computer science, hash tables continue to be the focus of a great deal of both theoretical and empirical research. A central reason for this is that many of the fundamental properties that one desires from a hash table are difficult to achieve simul...
Main Authors: | Bender, Michael, Conway, Alex, Farach-Colton, Martin, Kuszmaul, William, Tagliavini, Guido |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM
2023
|
Online Access: | https://hdl.handle.net/1721.1/152617 |
Similar Items
-
IcebergHT: High Performance Hash Tables Through Stability and Low Associativity
by: Pandey, Prashant, et al.
Published: (2023) -
On the Optimal Time/Space Tradeoff for Hash Tables
by: Bender, Michael A., et al.
Published: (2022) -
Tiny Pointers
by: Bender, Michael, et al.
Published: (2024) -
A distributed Hash table
by: Dabek, Frank (Frank Edward), 1977-
Published: (2008) -
Optimal Arrangement of Keys in a Hash Table
by: Rivest, Ronald L.
Published: (2023)