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: 6609
Venue: SIGMOD
Year: 2023
Pagerank: 5.1413982e-05
Overall Rank: 6,226 | 56.73%
DOI: 10.1145/3588959

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
7,480	Buffered Persistence in B+ Trees	2024	SIGMOD	4.7135369e-05
7,894	LITS: An Optimized Learned Index for Strings	2024	VLDB	4.6196003e-05
10,151	DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory	2026	SIGMOD	4.1905499e-05
11,012	Sorting on Byte-Addressable Storage: The Resurgence of Tree Structure	2024	VLDB	4.1905499e-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
66	Spark SQL: Relational Data Processing in Spark	2015	SIGMOD	0.00061707583
643	FPTree: A Hybrid SCM-DRAM Persistent and Concurrent B-Tree for Storage Class Memory	2016	SIGMOD	0.00018733394
809	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00016409797
1,085	HOT: A Height Optimized Trie Index for Main-Memory Database Systems	2018	SIGMOD	0.00014173956
1,300	Reducing the Storage Overhead of Main-Memory OLTP Databases with Hybrid Indexes	2016	SIGMOD	0.00012711153
1,306	BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory	2018	VLDB	0.00012674725
1,823	Dash: Scalable Hashing on Persistent Memory	2020	VLDB	0.00010403355
1,835	Write-Behind Logging	2017	VLDB	0.00010356306
1,999	PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors	2011	VLDB	9.8287642e-05
2,508	LB+-Trees: Optimizing Persistent Index Performance on 3DXPoint Memory	2020	VLDB	8.6251065e-05
2,734	Efficiently Searching In-Memory Sorted Arrays: Revenge of the Interpolation Search?	2019	SIGMOD	8.2082721e-05
2,986	DPTree: Differential Indexing for Persistent Memory	2020	VLDB	7.7757727e-05
5,130	Memory Management Techniques for Large-Scale Persistent-Main-Memory Systems	2017	VLDB	5.6721688e-05
6,466	NBTree: a Lock-free PM-friendly Persistent B+-Tree for eADR-enabled PM Systems	2022	VLDB	5.04625e-05
6,789	Index-Accelerated Pattern Matching in Event Stores	2021	SIGMOD	4.9206048e-05
7,872	PiBench Online: Interactive Benchmarking of Persistent Memory Indexes	2020	VLDB	4.6264246e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,565	Efficient Concurrent Updates to Persistent Randomized Binary Search Trees	2025	VLDB	4.1905499e-05
809	Persistent B+-Trees in Non-Volatile Main Memory	2015	VLDB	0.00016409797
11,428	Hamming Tree: The Case for Memory-Aware Bit Flipping Reduction for NVM Indexing	2021	CIDR	4.1905499e-05
2,986	DPTree: Differential Indexing for Persistent Memory	2020	VLDB	7.7757727e-05
12,420	Towards Efficient Main-Memory Use For Optimum Tree Index Update	2008	VLDB	4.1905499e-05
11,830	Anti-Persistence on Persistent Storage: History-Independent Sparse Tables and Dictionaries	2016	PODS	4.1905499e-05
1,807	Main-Memory Index Structures with Fixed-Size Partial Keys	2001	SIGMOD	0.0001047644
3,341	Evaluating Persistent Memory Range Indexes	2020	VLDB	7.1984492e-05
4,900	Persistent Memory Hash Indexes: An Experimental Evaluation	2021	VLDB	5.8418066e-05
8,990	The Past, Present and Future of Indexing on Persistent Memory	2022	VLDB	4.4115395e-05