• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Sdks & Libraries
    3. RaBitQ

    RaBitQ

    RaBitQ is an open-source library implementing the "Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search" method, providing vector quantization and compression techniques designed to improve efficiency and accuracy of ANN search engines and vector databases operating in high-dimensional spaces.

    🌐Visit Website

    About this tool

    RaBitQ

    Category: SDKs & Libraries
    Slug: rabitq
    Source: https://github.com/gaoj0017/RaBitQ

    Description

    RaBitQ is an open-source implementation of the SIGMOD 2024 method "Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search." It provides vector quantization and compression techniques aimed at improving the efficiency and accuracy of approximate nearest neighbor (ANN) search engines and vector databases operating in high-dimensional spaces.

    Features

    • Implementation of the RaBitQ quantization method for high-dimensional vectors.
    • Designed for approximate nearest neighbor search in Euclidean space.
    • Vector quantization and compression suitable for high-dimensional ANN search engines and vector databases.
    • Theoretical error bound for distance estimation between vectors.
    • Reference implementation aligned with the SIGMOD 2024 publication.
    • Example datasets and preprocessing scripts under ./data/ with detailed instructions in ./data/README.md.
    • Index construction components (e.g., IVF-RaBitQ) under ./src/ivf_rabitq.h.
    • Supporting utilities for vector space handling and fast scan operations (space.h, fast_scan.h).
    • Result generation pipeline with outputs stored under ./results/.
    • Dependency on Eigen for linear algebra operations.
    • Technical report (technical_report.pdf) and published paper citation information for research use.
    • Companion, more practical library referenced at RaBitQ-Library for extended/production-focused usage.

    Technical Requirements

    • C++ toolchain capable of building the code in ./src/.
    • Eigen library installed and available to the build system.

    Typical Workflow

    1. Download and preprocess datasets using the scripts and instructions in ./data/README.md.
    2. Build and run the index construction (e.g., IVF-RaBitQ) from the src directory.
    3. Run query tests over the indexed datasets.
    4. Inspect generated metrics and outputs in the ./results/ directory.

    License

    • The repository includes a LICENSE file (see GitHub project for exact terms).

    Pricing

    • Open-source software; no pricing information is provided (use is governed by the repository’s license).
    Surveys

    Loading more......

    Information

    Websitegithub.com
    PublishedDec 25, 2025

    Categories

    1 Item
    Sdks & Libraries

    Tags

    3 Items
    #Ann#vector compression#High Dimensional

    Similar Products

    6 result(s)
    ANN Library

    A C++ library for approximate nearest neighbor searching in arbitrarily high dimensions, developed by David Mount and Sunil Arya at the University of Maryland. Provides data structures and algorithms for both exact and approximate nearest neighbor searching.

    vsag

    vsag is an Alibaba open-source library implementing efficient vector search algorithms, including approximate nearest neighbor search for high-dimensional vectors.

    Annoy

    An open-source library for approximate nearest neighbor search in high-dimensional spaces, often used as a backend for vector databases and search engines.

    NMSLIB

    NMSLIB is an efficient similarity search library and toolkit for high-dimensional vector spaces, supporting a variety of indexing algorithms for vector database use cases.

    PQ (Product Quantization)

    Product Quantization is a compression and indexing technique for vector search that splits vectors into subspaces and quantizes each part separately, allowing vector databases to store large-scale embeddings compactly while supporting efficient ANN search.

    DET-LSH

    DET-LSH is a locality-sensitive hashing scheme that introduces a dynamic encoding tree structure to accelerate approximate nearest neighbor (ANN) search in high-dimensional spaces. While it is a research algorithm rather than a production database, it directly targets the core operation behind vector databases—efficient ANN search over vector embeddings—and is relevant for designing or optimizing vector indexing components within vector database systems.

    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