• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Open Sources
    3. KGraph

    KGraph

    KGraph is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database solutions.

    🌐Visit Website

    About this tool

    KGraph

    KGraph is an open-source library for fast approximate nearest neighbor (ANN) search in high-dimensional vector spaces, with applications in vector database solutions and similarity search.

    Features

    • k-NN Graph Construction: Builds k-nearest neighbor graphs for datasets.
    • Online k-NN Search: Supports fast approximate search using the constructed k-NN graph as an index.
    • Heuristic Algorithms: Implements generic and fast heuristic algorithms for ANN search.
    • C++ API: Main API is in C++, providing maximum flexibility and performance. Users define custom similarity functions via oracles (callback classes).
    • Python Wrapper: Provides a Python API (kgraph), supporting Euclidean and Angular distances on rows of NumPy matrices.
    • Parameter Tuning: Both index construction and search support various optional parameters to tune performance.
    • Efficient Oracle Implementations: Includes oracle implementations for common similarity measures.
    • No Assumptions on Similarity Properties: Algorithms do not assume properties like the triangle inequality.
    • Installation: Can be built using CMake or a provided Makefile; Python API installable with python setup.py install.
    • Open Source: Source code available on GitHub under an open-source license.

    Pricing

    KGraph is open-source and free to use.

    Links

    • GitHub Repository
    • Doxygen Documentation
    Surveys

    Loading more......

    Information

    Websitegithub.com
    PublishedJun 7, 2025

    Categories

    1 Item
    Open Sources

    Tags

    4 Items
    #Open Source#Ann#Similarity Search#Vector Search

    Similar Products

    6 result(s)
    arroy

    Arroy is an open-source library for efficient similarity search and management of vector embeddings, useful in vector database systems.

    HVS (Hierarchical Graph Structure)

    HVS is a graph-based index structure leveraging Voronoi diagrams for approximate nearest neighbor search in high-dimensional vector spaces. It is directly relevant to vector databases as it provides efficient similarity search capabilities for large-scale vector data.

    MRPT

    MRPT (Multi-Resolution Proximity Trees) is an open-source library for fast approximate nearest neighbor search in high-dimensional vector spaces, applicable to vector database backends.

    NGT

    NGT (Neighborhood Graph and Tree) is an open-source vector search engine designed for fast and scalable approximate nearest neighbor search.

    puck

    Puck is an open-source vector search engine designed for fast similarity search and retrieval of embedding vectors.

    Voyager

    Voyager is a Spotify open-source vector search library and service for efficient nearest neighbor search on large-scale vector datasets.

    Decorative pattern
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

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

    Product

    • Categories
    • Tags
    • 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