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 optimiz...
Xin-Peng Zhao, Ze-Ling Long, Chaichon Wongkham et al.· 0 citations
Aker is presented, an approximate cache for disk-based ANNS that implements a low-overhead refresh mechanism that bounds cache staleness while preserving search accuracy and integrates into pgvector and is evaluated on representative workloads.
Sukjoon Oh, Minki Kang, Dohyun Kim et al.· Proceedings of the VLDB Endo...· 0 citations
A novel architecture called S !"#$, designed to enhance the performance of hash indexes in disaggregated memory, is introduced and the results show that S !"#$ outperforms state-of-the-art DM-optimized hash indexes by at most 6.7 → (RACE), 3.6 → (SepHash), and 1.8 → (Outback) in YCSB workloads, respectively.
Han-Tian Zha, Teng Ma, Bao-Tong Lu et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.