GoVector: An I/O-Efficient Caching Strategy for High-Dimensional Vector Nearest Neighbor Search
Yijie Zhou, Shengyuan Lin, Shufeng Gong, Song Yu, Shuhao Fan, Yanfeng Zhang, Ge Yu

TL;DR
GoVector introduces an I/O-efficient caching and data layout strategy for disk-based high-dimensional vector search, significantly reducing I/O bottlenecks and improving query performance.
Contribution
It proposes a novel combined static and dynamic caching strategy along with node reordering to optimize disk I/O in graph-based ANNS systems.
Findings
Reduces I/O operations by 46% at 90% recall
Increases query throughput by 1.73 times
Lowers query latency by 42%
Abstract
Graph-based high-dimensional vector indices have become a mainstream solution for large-scale approximate nearest neighbor search (ANNS). However, their substantial memory footprint often requires storage on secondary devices, where frequent on-demand loading of graph and vector data leads to I/O becoming the dominant bottleneck, accounting for over 90\% of query latency. Existing static caching strategies mitigate this issue only in the initial navigation phase by preloading entry points and multi-hop neighbors, but they fail in the second phase where query-dependent nodes must be dynamically accessed to achieve high recall. We propose GoVector, an I/O-efficient caching strategy tailored for disk-based graph indices. GoVector combines (1) a static cache that stores entry points and frequently accessed neighbors, and (2) a dynamic cache that adaptively captures nodes with high spatial…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Graph Theory and Algorithms · Advanced Image and Video Retrieval Techniques
