• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. SOAR

    SOAR

    SOAR is a set of improved algorithms on top of ScaNN that accelerate vector search by introducing controlled redundancy and multi-cluster assignment, enabling faster approximate nearest neighbor retrieval with smaller indexes in large‑scale vector databases and search systems.

    🌐Visit Website

    About this tool

    SOAR

    Brand: Google Research
    Category: Research Papers & Surveys
    Type: Vector search algorithm (on top of ScaNN)
    Source: SOAR: New algorithms for even faster vector search with ScaNN

    SOAR illustration

    Description

    SOAR (Spilling with Orthogonality-Amplified Residuals) is a set of improved algorithms built on top of the ScaNN vector search library. It focuses on accelerating approximate nearest neighbor (ANN) search over large-scale embedding datasets by introducing controlled redundancy and multi-cluster assignment. This design enables faster vector similarity search while keeping index sizes relatively small and preserving key index quality metrics.

    Key Details

    • Domain: Approximate nearest neighbor (ANN) / vector similarity search
    • Primary use cases: Large-scale embedding search for ML applications (e.g., image, web, media retrieval; retrieval-augmented generation systems)
    • Publication: “SOAR: Improved Indexing for Approximate Nearest Neighbor Search” (NeurIPS 2023)
    • Underlying system: Extends and enhances the ScaNN open-source vector search library

    Features

    • Improved indexing for ANN search

      • Introduces a new indexing approach (SOAR) that refines how ScaNN structures and searches large embedding datasets.
    • Controlled redundancy in the vector index

      • Adds mathematically designed redundancy to the index to improve search efficiency.
      • Redundancy is engineered to have minimal impact on overall index size and other index metrics.
    • Multi-cluster assignment

      • Assigns vectors to multiple clusters (multi-cluster assignment) to increase the likelihood that true nearest neighbors are retrieved quickly.
      • Supports faster approximate nearest neighbor retrieval, especially at large scales.
    • Orthogonality-amplified residuals (conceptual)

      • Uses residual-based techniques that emphasize orthogonality properties to make redundancy more effective for search.
      • Designed to complement ScaNN’s existing partitioning and scoring mechanisms.
    • Faster vector search at scale

      • Targets large-scale deployments where brute-force search is infeasible.
      • Aims to reduce latency and computation per query for vector similarity search workloads.
    • Smaller, efficient indexes

      • Seeks a balance between added redundancy and compact index representation, keeping index growth modest while improving recall and performance.
    • Integration with ScaNN

      • Builds directly on the ScaNN library, which is already widely used and open-sourced.
      • Can be applied in settings where ScaNN is used for embedding-based retrieval within production ML systems.

    Applications

    • Large-scale embedding retrieval for search and recommendation systems.
    • Retrieval-augmented generation (RAG) workflows requiring fast ANN lookup.
    • Any ML system that relies on efficient vector similarity search over very large collections of embeddings.

    Pricing

    Not applicable. SOAR is presented as a research contribution and algorithmic improvement to the open-source ScaNN library; no pricing information is provided in the source content.

    Surveys

    Loading more......

    Information

    Websiteresearch.google
    PublishedDec 25, 2025

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    3 Items
    #Ann#Vector Search#Optimization

    Similar Products

    6 result(s)
    LoRANN

    Low-Rank Matrix Factorization algorithm for Approximate Nearest Neighbor Search, offering competitive performance with faster query times than leading libraries at various recall levels.

    BANG

    BANG is a billion-scale approximate nearest neighbor search system optimized for single GPU execution, enabling high-performance vector search in vector database environments at massive scale.

    LANNS: a web-scale approximate nearest neighbor lookup system

    A scalable system for approximate nearest neighbor search at web-scale, relevant for implementing and understanding vector database infrastructure for high-dimensional data.

    Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs

    This paper introduces the HNSW algorithm, which is widely adopted in vector databases and search engines for its efficient and robust performance on high-dimensional data. HNSW is foundational in powering modern vector search systems.

    Li, Wen, et al. "Approximate nearest neighbor search on high dimensional data—experiments, analyses, and improvement."

    An influential paper analyzing and improving approximate nearest neighbor search methods for high-dimensional data, highly relevant for developing and understanding vector databases.

    faiss-quickeradc

    faiss-quickeradc is an extension of FAISS that implements the Quicker ADC approach to accelerate product-quantization-based approximate nearest neighbor search using SIMD, improving performance in vector database retrieval.

    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