Skip to content

Author

Bao-Tong Lu

We have 3 of 13 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

Decoupling Disaggregated Memory Optimizations from Indexing: A Compiler-Runtime Approach

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
Open access Jun 2026

Aker: Density-Aware Approximate Caching for Vector Search

Disk-based approximate nearest neighbor search (ANNS) incurs high I/O overhead due to frequent disk accesses during index traversal. Approximate caching, which reuses the results of past queries to serve future similar queries, offers a promising approach to bypass disk searches. However, existing approaches suffer fro...

Sukjoon Oh, Minki Kang, Dohyun Kim et al. · 0 citations

S !"#$ : A Scalable and Resize-optimized Hash Index on Disaggregated Memory

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.