Metraipolis › archive › dc_b67ebb951cd6
Decoupling Disaggregated Memory Optimizations from Indexing: A Compiler-Runtime Approach — arXiv:2609.02669
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.02669
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T05:53:15.147Z
- SHA-256 of the archived text
7f4de85eda167b1ec7f1bcab36c24b29da5d247b72fe921785e7eeba9d5e6a26- Stable URL of this page
https://metraipolis.com/documento/dc_b67ebb951cd6
How to cite
Decoupling Disaggregated Memory Optimizations from Indexing: A Compiler-Runtime Approach — arXiv:2609.02669 — arXiv (en), https://arxiv.org/abs/2609.02669 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b67ebb951cd6 (Metraipolis archive dc_b67ebb951cd6, sha256 7f4de85eda167b1ec7f1bcab36c24b29da5d247b72fe921785e7eeba9d5e6a26)
BibTeX
@misc{dcb67ebb951cd6,
title = {Decoupling Disaggregated Memory Optimizations from Indexing: A Compiler-Runtime Approach — arXiv:2609.02669},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.02669},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b67ebb951cd6; sha256 7f4de85eda167b1ec7f1bcab36c24b29da5d247b72fe921785e7eeba9d5e6a26},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.02669. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Disaggregated memory (DM) decouples compute and memory into independently scalable pools, connected over a slower interconnect rather than a local bus. This decoupling is exactly what makes DM attractive--but it also means that every index must now reason explicitly about remote-memory access and its associated optimizations. State-of-the-art index designs respond to this by embedding remote-memory logic and optimizations directly into their core data structures and concurrency control mechanisms. Consequently, an optimization tuned for one index cannot be lifted and reused in another, and even the same index cannot be ported to a different DM architecture without a fresh round of redesign. This escalating, per-index, per-platform engineering burden is unsustainable as hardware and index requirements evolve. In this paper, we present Nox, a compiler-runtime framework that breaks this coupling by taking an unmodified, concurrent index as input and automatically generating its disaggregated-memory counterpart, without touching the original index logic. A compiler layer rewrites the index's LLVM IR to expose allocation, address, and pointer-dependency information that a centralized runtime uses to drive caching and address translation. Empirically, Nox-generated B+-trees, hash tables, and skip lists scale robustly on real RDMA and CXL hardware across every workload tested. They can also outperform some specialized, hand-crafted indexes and match others, especially on workloads that are closer to real-world ones. These results show that today's fastest disaggregated-memory optimizations need not stay locked inside monolithic, hand-crafted code--a compiler-runtime stack can generalize them while preserving the scalability of proven index implementations, without sacrificing it for portability. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-03 in cs.DB). Categorie arXiv: Databases (cs.DB). Pagina del lavoro: https://arxiv.org/abs/2609.02669 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-17T05:45:49.783Z dalla pagina https://arxiv.org/catchup/cs.DB/2026-09-03?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).