2 papers
cs.DB2024
Subspace Collision: An Efficient and Accurate Framework for High-dimensional Approximate Nearest Neighbor Search
Jiuqi Wei, Xiaodong Lee, Zhenyu Liao +2
Approximate Nearest Neighbor (ANN) search in high-dimensional Euclidean spaces is a fundamental problem with a wide range of applications. However, there is currently no ANN method…
cs.DB2024
-Hardness: A Query Hardness Measure for Graph-Based ANN Indexes
Zeyu Wang, Qitong Wang, Xiaoxing Cheng +3
Graph-based indexes have been widely employed to accelerate approximate similarity search of high-dimensional vectors. However, the performance of graph indexes to answer different…