Pea Hash: A Performant Extendible Adaptive Hashing Index

Summary: Pea Hash offers an adaptive hashing strategy that jointly optimizes latency and memory use, plus data-aware buckets for unique keys and duplicates. NVMe-enabled Pea Hash achieves up to 13.8x speedup over state-of-the-art NVMe hashes with similar memory; a DRAM variant outperforms prior in-DRAM hashes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: h8bb33b3426fd3304
Venue: SIGMOD
Year: 2023
Pagerank: 5.3501391e-05
Overall Rank: 8,264 | 44.61%
DOI: 10.1145/3588962
PDF: Download (CC BY 4.0)

Incoming Non-self Citations Over Time

Authors

1. Zhuoxuan Liu (Institute of Computing Technology, Chinese Academy of Sciences; University of Chinese Academy of Sciences)
2. Shimin Chen (Institute of Computing Technology, Chinese Academy of Sciences; University of Chinese Academy of Sciences)

BibTeX Citation

@inproceedings{liu_sigmod23,
        title = {{Pea Hash: A Performant Extendible Adaptive Hashing Index}},
        author = {Liu, Zhuoxuan and Chen, Shimin},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588962},
        url = {https://dl.acm.org/doi/10.1145/3588962},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
6,500	Bf-Tree: A Modern Read-Write-Optimized Concurrent Larger-Than-Memory Range Index	2024	VLDB	5.7478171e-05
9,682	Sphinx: A Succinct Perfect Hash Index for x86	2025	VLDB	5.1258854e-05
10,552	LINE: A Learned Index with Group-Enhanced Leaves and Cache-Optimized Inner Tree	2026	SIGMOD	4.9605343e-05
11,122	SHARD: A Scalable and Resize-optimized Hash Index on Disaggregated Memory	2026	VLDB	4.9605343e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
230	A Study of Index Structures for Main Memory Database Management Systems	1986	VLDB	0.00023845485
250	Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited	2014	VLDB	0.00023080446
504	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00017195543
632	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00015366735
671	Rethinking Database Algorithms for Phase Change Memory	2011	CIDR	0.00014912266
967	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012766144
1,366	Dash: Scalable Hashing on Persistent Memory	2020	VLDB	0.00010879316
1,863	LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory	2020	VLDB	9.4679185e-05
2,516	Viper: An Efficient Hybrid PMem-DRAM Key-Value Store	2021	VLDB	8.3436817e-05
6,089	Halo: A Hybrid PMem-DRAM Persistent Hash Index with Fast Recovery	2022	SIGMOD	5.8731638e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,783	IcebergHT: High Performance Hash Tables Through Stability and Low Associativity	2023	SIGMOD
2	10,848	Succinct and Fast Tiny Pointer Hash Tables	2026	VLDB
3	4,136	Memory-Contention Responsive Hash Joins	1994	VLDB
4	5,509	Plush: A Write-Optimized Persistent Log-Structured Hash-Table	2022	VLDB
5	7,516	B^link-hash: An Adaptive Hybrid Index for In-Memory Time-Series Databases	2023	VLDB
6	6,075	When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories	2023	SIGMOD
7	11,122	SHARD: A Scalable and Resize-optimized Hash Index on Disaggregated Memory	2026	VLDB
8	7,044	SepHash: A Write-Optimized Hash Index On Disaggregated Memory via Separate Segment Structure	2024	VLDB
9	1,366	Dash: Scalable Hashing on Persistent Memory	2020	VLDB
10	4,534	Persistent Memory Hash Indexes: An Experimental Evaluation	2021	VLDB