3 papers
cs.DB2026
Optimizing SSD-Resident Graph Indexing for High-Throughput Vector Search
Weichen Zhao, Yuncheng Lu, Yao Tian +5
Graph-based approximate nearest neighbor search (ANNS) methods (e.g., HNSW) have become the de facto state of the art for their high precision and low latency. To scale beyond main…
cs.DB2025
RapidStore: An Efficient Dynamic Graph Storage System for Concurrent Queries
Chiyu Hao, Jixian Su, Shixuan Sun +7
Dynamic graph storage systems are essential for real-time applications such as social networks and recommendation, where graph data continuously evolves. However, they face signifi…
cs.DB2025
Revisiting the Design of In-Memory Dynamic Graph Storage
Jixian Su, Chiyu Hao, Shixuan Sun +7
The effectiveness of in-memory dynamic graph storage (DGS) for supporting concurrent graph read and write queries is crucial for real-time graph analytics and updates. Various meth…