DiskANN++: Efficient Page-based Search over Isomorphic Mapped Graph Index using Query-sensitivity Entry Vertex

Jiongkang Ni, Xiaoliang Xu, Yuxiang Wang +4

Given a vector dataset $\mathcal{X}$ and a query vector ${\vec{x}}_q$, graph-based Approximate Nearest Neighbor Search (ANNS) aims to build a graph index $G$ and approximately return…