DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory
Summary: DART: lock-free, crash-consistent two-layer hashed ART for disaggregated memory. Uses a hashed upper skip table + in-node adaptive hash layout to cut remote round trips and confine search to small buckets, boosting concurrency/scalability up to 5.8x on YCSB. (summarized by gpt-5.4-mini on Apr 11 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Bowen Zhang (Shanghai Jiao Tong University)
- 2. Shengan Zheng (Shanghai Jiao Tong University)
- 3. Shi Shu (Shanghai Jiao Tong University)
- 4. Jingxiang Li (Shanghai Jiao Tong University)
- 5. Zhenlin Qi (Shanghai Jiao Tong University)
- 6. Weiquan Huang (Shanghai Jiao Tong University)
- 7. Jianguo Wang (Purdue University)
- 8. Linpeng Huang (Shanghai Jiao Tong University)
- 9. Hong Mei (Peking University)
BibTeX Citation
@inproceedings{zhang_sigmod26,
title = {{DART: A Lock-free Two-layer Hashed ART Index for Disaggregated Memory}},
author = {Zhang, Bowen and Zheng, Shengan and Shu, Shi and Li, Jingxiang and Qi, Zhenlin and Huang, Weiquan and Wang, Jianguo and Huang, Linpeng and Mei, Hong},
series = {{SIGMOD} '26},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3786636},
url = {https://dl.acm.org/doi/10.1145/3786636},
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 15 of 15 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 | 280 | FAST: Fast Architecture Sensitive Tree Search on Modern CPUs and GPUs | 2010 | SIGMOD |
| 2 | 8,264 | Pea Hash: A Performant Extendible Adaptive Hashing Index | 2023 | SIGMOD |
| 3 | 1,974 | Sherman: A Write-Optimized Distributed B+Tree Index on Disaggregated Memory | 2022 | SIGMOD |
| 4 | 6,075 | When Tree Meets Hash: Reducing Random Reads for Index Structures on Persistent Memories | 2023 | SIGMOD |
| 5 | 1,370 | Designing Distributed Tree-based Index Structures for Fast RDMA-capable Networks | 2019 | SIGMOD |
| 6 | 10,491 | ART That Lasts: Persistent Multiversion Adaptive Radix Trees with Fast Atomic Range Queries | 2026 | SIGMOD |
| 7 | 7,044 | SepHash: A Write-Optimized Hash Index On Disaggregated Memory via Separate Segment Structure | 2024 | VLDB |
| 8 | 5,965 | DEX: Scalable Range Indexing on Disaggregated Memory | 2024 | VLDB |
| 9 | 7,590 | Scalable Distributed Inverted List Indexes in Disaggregated Memory | 2024 | SIGMOD |
| 10 | 11,122 | SHARD: A Scalable and Resize-optimized Hash Index on Disaggregated Memory | 2026 | VLDB |