CaucherWang / Steiner-hardness
A new query hardness measure for graph-based ANN indexes. Build unbiased workloads with this hardness to see the actual performance of your ANN indexes.
☆11Updated last month
Related projects ⓘ
Alternatives and complementary repositories for Steiner-hardness
- [SIGMOD 2023] High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations☆42Updated last year
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆29Updated last month
- Article: GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction by Authors Yuanhang Yu, Dong Wen, Ying Zhan…☆15Updated 3 years ago
- A Comprehensive Survey and Experimental Comparison of Graph-based Approximate Nearest Neighbor Search