• Home
  • Categories
  • Pricing
  • Submit
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

    Get the latest updates and exclusive content delivered to your inbox.

    Product

    • Categories
    • Pricing
    • Help

    Clients

    • Sign In
    • Register
    • Forgot password?

    Company

    • About Us
    • Admin
    • Sitemap

    Resources

    • Blog
    • Submit
    • API Documentation
    All product names, logos, and brands are the property of their respective owners. All company, product, and service names used in this repository, related repositories, and associated websites are for identification purposes only. The use of these names, logos, and brands does not imply endorsement, affiliation, or sponsorship. This directory may include content generated by artificial intelligence.
    Copyright © 2025 Awesome Vector Databases. All rights reserved.·Terms of Service·Privacy Policy·Cookies
    Decorative pattern
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. FINGER — Fast Inference for Graph-based ANNS

    FINGER — Fast Inference for Graph-based ANNS

    FINGER provides a fast inference framework for graph-based approximate nearest neighbor search, optimizing search path traversal to reduce query latency while maintaining high recall. Published at Web 2023.

    Overview

    FINGER is a fast inference framework for graph-based approximate nearest neighbor search that optimizes the search traversal process.

    Key Contributions

    • Accelerates graph-based ANNS inference
    • Optimizes search path selection during traversal
    • Reduces query latency while maintaining high recall
    • Published at The Web Conference (WWW) 2023

    Publication

    • Venue: Web 2023
    • Authors: Chen et al.
    • Abbreviation: FINGER

    Features

    • Fast search path inference on proximity graphs
    • Compatible with various graph-based indexes
    • Low-latency query processing
    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedApr 4, 2026

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    3 Items
    #graph-index#inference#high-performance

    Similar Products

    6 result(s)

    Accelerating Graph Indexing for ANNS on Modern CPUs

    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.

    Baseten

    GPU inference platform providing optimized model serving for embedding models and LLMs, featuring the high-performance Baseten Performance Client built in Rust for superior batch embedding throughput.

    Accelerating ANNS in Hierarchical Graphs via Shortcuts

    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.

    Accelerating Graph-based ANNS with Adaptive Awareness

    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.

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

    VLDB 2023 paper proposing ARKGraph, a graph-based method for all-range approximate k-nearest neighbor search that adapts to various recall requirements.

    EFANNA — Extremely Fast Approximate Nearest Neighbor Search Based on kNN 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.