ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries
Summary: PermART integrates multiversioning and in-node logging into a persistent Adaptive Radix Tree for NVM. It delivers competitive point-query/update performance while enabling efficient, linearizable concurrent range queries—absent from prior durable indexes. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Arash Khalaji (University of Waterloo)
- 2. Trevor Brown (University of Waterloo)
- 3. Khuzaima Daudjee (University of Waterloo)
BibTeX Citation
@inproceedings{khalaji_sigmod26,
title = {{ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries}},
author = {Khalaji, Arash and Brown, Trevor and Daudjee, Khuzaima},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3802015},
url = {https://dl.acm.org/doi/10.1145/3802015},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,207 | The HV-tree: a Memory Hierarchy Aware Version Index | 2010 | VLDB |
| 2 | 2,824 | Transaction Time Indexing with Version Compression | 2008 | VLDB |
| 3 | 3,808 | Making Updates Disk-I/O Friendly Using SSDs | 2013 | VLDB |
| 4 | 5,501 | Efficient Computation of Temporal Aggregates with Range Predicates | 2001 | PODS |
| 5 | 7,595 | Query Processing Techniques for Multiversion Access Methods | 1996 | VLDB |
| 6 | 948 | BzTree: A High-Performance Latch-free Range Index for Non-Volatile Memory | 2018 | VLDB |
| 7 | 621 | Persistent B+-Trees in Non-Volatile Main Memory | 2015 | VLDB |
| 8 | 10,824 | Efficient Concurrent Updates to Persistent Randomized Binary Search Trees | 2025 | VLDB |
| 9 | 6,126 | Efficient Bulk Updates on Multiversion B-trees | 2013 | VLDB |
| 10 | 5,954 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |