• Home
  • Categories
  • Tags
  • Pricing
  • Submit
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. OneSparse: A Unified System for Multi-index Vector Search

    OneSparse: A Unified System for Multi-index Vector Search

    A unified system designed for efficient multi-index vector search, directly addressing large-scale vector database performance and scalability challenges.

    🌐Visit Website

    About this tool

    OneSparse: A Unified System for Multi-index Vector Search

    Category: Research Papers & Surveys
    Tags: vector-search, performance, scalability, research

    Description

    OneSparse is a unified system developed for efficient multi-index vector search, directly addressing performance and scalability challenges in large-scale vector databases. It is particularly relevant for applications such as recommendation systems and search engines that require efficient retrieval from hybrid data sets containing both sparse and dense vectors.

    Features

    • Unified Multi-Vector Index Query System: Integrates multiple posting-based vector indices to enable efficient retrieval from multi-modal datasets.
    • Novel Query Engine Design: Introduces inter-index intersection push-down, a technique that allows for more efficient joint searches across multiple indices.
    • Optimized Vector Posting Format: Enhances the performance of multi-index queries by optimizing how vectors are stored and accessed.
    • Performance Improvement: Achieves over 6× search performance improvement compared to traditional approaches, while maintaining comparable accuracy.
    • Real-world Deployment: Integrated into Microsoft online web search and advertising systems, resulting in significant latency reduction (5×+ for Bing web search) and increased revenue metrics (2.0% RPM gain for Bing sponsored search).
    • Supports Hybrid Queries: Designed for multi-modal queries and multi-model ensemble queries, allowing joint search on multiple vector indices (e.g., sparse and dense vectors).
    • Addresses Limitations of Existing Methods: Overcomes inefficiencies and algorithmic limitations of isolated search and vector fusion approaches.
    • Efficient Approximate Nearest Neighbor (ANN) Search: Supports fast and accurate approximate Top-K queries across multiple indices.
    • Minimizes Redundant Computation: Reduces unnecessary disk I/O and score computation by optimizing intersection and ranking processes.

    Source

    Read the Paper (PDF)

    Pricing

    Not applicable (research paper).

    Surveys

    Loading more......

    Information

    Websitewww.microsoft.com
    PublishedJun 7, 2025

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    4 Items
    #Vector Search#Performance#Scalability#Research

    Similar Products

    6 result(s)
    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.

    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.

    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.

    Billion-scale ANNS Benchmarks

    A benchmarking resource for evaluating approximate nearest neighbor search (ANNS) methods on billion-scale datasets, highly relevant for assessing the scalability of vector databases.

    Qdrant's Vector Database Benchmarks

    A set of benchmarks provided by Qdrant for evaluating vector databases, focusing on speed, scalability, and accuracy of vector search operations.

    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