When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories

Summary: Extendible Radix Tree (ERT) for persistent memory combines a radix-tree with per-node extendible hashing to achieve large fanout, small height, and constant-time in-node lookups, reducing random reads during traversal. Range queries use partial ordering in each node's hash table; inserts/updates are incremental with limited writes; experiments show up to 2.65x search, 4.41x insert, and 2.43x range-query speedups over state-of-the-art PM indexes. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: hadbb27b415c2e152
Venue: SIGMOD
Year: 2023
Pagerank: 5.8940295e-05
Overall Rank: 6,070 | 59.21%
DOI: 10.1145/3588959
PDF: Download (CC BY 4.0)

Incoming Non-self Citations Over Time

Authors

1. Ke Wang (Shanghai Qi Zhi Institute; Yale University)
2. Guanqun Yang (New York University; Shanghai Qi Zhi Institute)
3. Yiwei Li (Tsinghua University)
4. Huanchen Zhang (Shanghai Qi Zhi Institute; Tsinghua University)
5. Mingyu Gao (Shanghai Qi Zhi Institute; Tsinghua University)

BibTeX Citation

@inproceedings{wang_sigmod23,
        title = {{When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories}},
        author = {Wang, Ke and Yang, Guanqun and Li, Yiwei and Zhang, Huanchen and Gao, Mingyu},
        series = {{SIGMOD} '23},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3588959},
        url = {https://dl.acm.org/doi/10.1145/3588959},
        year = {2023}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,082	LITS: An Optimized Learned Index for Strings	2024	VLDB	5.6010119e-05
8,082	Buffered Persistence in B+ Trees	2024	SIGMOD	5.3917406e-05
10,640	DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory	2026	SIGMOD	4.9769913e-05
11,563	Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure	2024	VLDB	4.9769913e-05

Outgoing Citations (Sorted by Pagerank)

Showing 16 of 16 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
23	Spark SQL: Relational Data Processing in Spark	2015	SIGMOD	0.00055384955
502	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00017250394
630	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00015412011
904	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00013170142
960	Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes	2016	SIGMOD	0.0001283613
966	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012806678
1,359	Dash: Scalable Hashing on Persistent Memory	2020	VLDB	0.00010914954
1,437	Write-Behind Logging	2017	VLDB	0.00010651307
1,856	LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory	2020	VLDB	9.4960518e-05
1,857	PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors	2011	VLDB	9.4935317e-05
2,235	Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?	2019	SIGMOD	8.787006e-05
2,277	DPTree: Differential Indexing for Persistent Memory	2020	VLDB	8.7072748e-05
4,442	Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems	2017	VLDB	6.5966146e-05
6,065	NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems	2022	VLDB	5.8953182e-05
6,677	Index-Accelerated Pattern Matching in Event Stores	2021	SIGMOD	5.7105065e-05
8,029	PiBench Online: Interactive Benchmarking of Persistent Memory Indexes	2020	VLDB	5.402748e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	630	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB
2	11,936	Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing	2021	CIDR
3	10,425	ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries	2026	SIGMOD
4	12,901	Towards Efficient Main-Memory Use For Optimum Tree Index Update	2008	VLDB
5	2,277	DPTree: Differential Indexing for Persistent Memory	2020	VLDB
6	12,326	Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries	2016	PODS
7	1,839	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD
8	2,742	Evaluating Persistent Memory Range Indexes	2020	VLDB
9	4,515	Persistent Memory Hash Indexes: An Experimental Evaluation	2021	VLDB
10	6,942	The Past, Present and Future of Indexing on Persistent Memory	2022	VLDB