• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Concepts & Definitions
    3. LIRE Protocol

    LIRE Protocol

    Lightweight incremental rebalancing protocol used in SPFresh for billion-scale vector updates with only 1% DRAM and <10% cores compared to global rebuild approaches.

    🌐Visit Website

    About this tool

    Overview

    LIRE (Lightweight Incremental Rebalancing Protocol) is the core algorithm in SPFresh that enables in-place vector updates for billion-scale vector indexes.

    How It Works

    LIRE achieves low-overhead vector updates by only reassigning vectors at the boundary between partitions, where in a high-quality vector index the amount of such vectors are deemed small. The protocol splits vector partitions and reassigns vectors in nearby partitions to adapt to data distribution shifts.

    Performance Benefits

    With LIRE, SPFresh provides superior query latency and accuracy to solutions based on global rebuild, with only 1% of DRAM and less than 10% cores needed at the peak compared to the state-of-the-art, in a billion scale vector index with 1% of daily vector update rate.

    Problem Solved

    Traditional systems maintain a secondary index to accumulate updates, which are merged by the main index by globally rebuilding the entire index periodically. This approach has high fluctuations of search latency and accuracy, requires substantial resources, and is extremely time-consuming for rebuilds.

    Real-World Adoption

    The LIRE protocol has been adopted in production systems like Turbopuffer for billion-scale vector search with incremental updates.

    Pricing

    Open-source research algorithm.

    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedMar 24, 2026

    Categories

    1 Item
    Concepts & Definitions

    Tags

    3 Items
    #Indexing#Incremental#Algorithm

    Similar Products

    6 result(s)
    IVF

    Inverted File Index vector search algorithm that partitions high-dimensional vectors into clusters using k-means, enabling efficient nearest neighbor search by restricting searches to relevant clusters and dramatically reducing search space.

    IVF-FLAT Index

    Inverted File Index with flat vectors using K-means clustering to partition high-dimensional space into regions, enhancing search efficiency by narrowing search area through neighbor partitions.

    Vector Index Comparison Guide (Flat, HNSW, IVF)
    Featured

    Comprehensive comparison of vector indexing strategies including Flat, HNSW, and IVF approaches. Covers performance characteristics, memory requirements, and use case recommendations for 2026.

    ACORN Algorithm for Filtered Vector Search

    Advanced algorithm designed to make hybrid searches combining metadata filters and vector similarity more efficient, implemented in Apache Solr and other vector search systems.

    Early Termination Strategy for HNSW

    Optimization technique that allows HNSW vector searches to exit early when the candidate queue remains saturated, reducing latency and resource usage with minimal recall impact.

    Co-partitioned Vector Index

    Indexing strategy where vector indexes are stored in the same partitions as corresponding table rows, ensuring data locality and operational advantages in distributed databases.

    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