ARKGraph — All-Range Approximate K-Nearest-Neighbor Graph

Paper proposing EFANNA, an extremely fast approximate nearest neighbor search algorithm based on kNN graph construction. The method introduces an efficient approximate kNN graph building approach and a search algorithm that achieves state-of-the-art query performance.

Foundational TPAMI 2018 paper introducing Hierarchical Navigable Small World (HNSW) graphs, one of the most widely adopted approximate nearest neighbor search algorithms. The hierarchical multi-layer graph structure enables logarithmic-time search with high recall.

Foundational paper introducing the navigable small world (NSW) graph algorithm for approximate nearest neighbor search, which became the basis for widely-used graph-based ANN methods including HNSW.

VLDB 2025 paper proposing efficient level navigation with shortcuts for accelerating approximate nearest neighbor search in hierarchical graph indexes, improving traversal speed across multi-layer graph structures.

SIGKDD 2025 paper proposing adaptive awareness capabilities for graph-based approximate nearest neighbor search, enabling the search algorithm to dynamically adjust its strategy based on local graph characteristics and query properties.

SIGMOD 2025 paper proposing optimizations for graph-based approximate nearest neighbor search indexing on modern CPU architectures, leveraging SIMD instructions and cache-aware algorithms for improved index construction performance.