A Write-Optimized Distributed B+Tree Index on Disaggregated Memory
Name
3712254.pdf
Size
471.91 KB
Format
Adobe PDF
Checksum (MD5)
227927a326e830c698d66a98b12be7c8
Author(s)
Kraska, Tim
Date Issued
April 15, 2025
Journal
Communications of the ACM
Publisher
ACM
Citation
Qing Wang, Youyou Lu, and Jiwu Shu. 2025. Designing an Efficient Tree Index on Disaggregated Memory. Commun. ACM 68, 5 (May 2025), 92–100.
Version
Final published version
Abstract
If it were possible to scale memory independently from compute, it would be feasible to dynamically adjust the amount of memory based on the workload. It would further enable better resource utilization. Consider a dynamic workload regarding the number of queries but with very strict response time requirements, which can only be met, if data is kept in-memory. In this case, the separation of compute and memory would enable to scale the compute with the number of queries while keeping all the data constantly in-memory. This design principle is already used by services such as Google, which keeps the entire web-index in-memory.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1145/3712254
