Building Write-Optimized Tree Indexes on Disaggregated Memory

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Memory disaggregation architecture physically separates CPU and memory into independent components, which are connected via high-speed RDMA networks, greatly improving resource utilization of database systems. However, such an architecture poses unique challenges to data indexing due to limited RDMA semantics and near-zero computation power at memory side. Existing indexes supporting disaggregated memory either suffer from low write performance, or require hardware modification.

Cite

CITATION STYLE

APA

Wang, Q., Lu, Y., & Shu, J. (2023). Building Write-Optimized Tree Indexes on Disaggregated Memory. SIGMOD Record, 52(1), 45–52. https://doi.org/10.1145/3604437.3604448

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free