Computer Science > Data Structures and Algorithms
arXiv:2210.04068 (cs)
[Submitted on 8 Oct 2022 (v1), last revised 11 Oct 2022 (this version, v2)]
Title:IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity
Authors:Prashant Pandey,Michael A. Bender,Alex Conway,Martín Farach-Colton,William Kuszmaul,Guido Tagliavini,Rob Johnson
View a PDF of the paper titled IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity, by Prashant Pandey and 6 other authors
View PDFAbstract:Modern hash table designs strive to minimize space while maximizing speed. The most important factor in speed is the number of cache lines accessed during updates and queries. This is especially important on PMEM, which is slower than DRAM and in which writes are more expensive than reads.
This paper proposes two stronger design objectives: stability and low-associativity. A stable hash table doesn't move items around, and a hash table has low associativity if there are only a few locations where an item can be stored. Low associativity ensures that queries need to examine only a few memory locations, and stability ensures that insertions write to very few cache lines. Stability also simplifies scaling and crash safety.
We present IcebergHT, a fast, crash-safe, concurrent, and space-efficient hash table for PMEM based on the design principles of stability and low associativity. IcebergHT combines in-memory metadata with a new hashing technique, iceberg hashing, that is (1) space efficient, (2) stable, and (3) supports low associativity. In contrast, existing hash-tables either modify numerous cache lines during insertions (e.g. cuckoo hashing), access numerous cache lines during queries (e.g. linear probing), or waste space (e.g. chaining). Moreover, the combination of (1)-(3) yields several emergent benefits: IcebergHT scales better than other hash tables, supports crash-safety, and has excellent performance on PMEM (where writes are particularly expensive).
| Subjects: | Data Structures and Algorithms (cs.DS); Databases (cs.DB) |
| Cite as: | arXiv:2210.04068 [cs.DS] |
| (orarXiv:2210.04068v2 [cs.DS] for this version) | |
| https://doi.org/10.48550/arXiv.2210.04068 arXiv-issued DOI via DataCite |
Submission history
From: Prashant Pandey [view email][v1] Sat, 8 Oct 2022 17:32:59 UTC (439 KB)
[v2] Tue, 11 Oct 2022 22:23:04 UTC (439 KB)
Full-text links:
Access Paper:
- View PDF
- TeX Source
- Other Formats
View a PDF of the paper titled IcebergHT: High Performance PMEM Hash Tables Through Stability and Low Associativity, by Prashant Pandey and 6 other authors
References & Citations
Bookmark
Bibliographic and Citation Tools
Bibliographic Explorer(What is the Explorer?)
Connected Papers(What is Connected Papers?)
Litmaps(What is Litmaps?)
scite Smart Citations(What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv(What is alphaXiv?)
CatalyzeX Code Finder for Papers(What is CatalyzeX?)
DagsHub(What is DagsHub?)
Gotit.pub(What is GotitPub?)
Hugging Face(What is Huggingface?)
Papers with Code(What is Papers with Code?)
ScienceCast(What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower(What are Influence Flowers?)
CORE Recommender(What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.