OdinANN: Direct Insert for Consistently Stable Performance in Billion-Scale Graph-Based Vector Search
Hao Guo · Youyou Lu
摘要
Approximate Nearest Neighbor Search (ANNS) is widely used in various scenarios. For billion-scale ANNS, on-disk graph-based indexes, which organize the vectors as a graph and store them on disk, are favored for their performance and cost-efficiency. However, existing indexes can not maintain a st...