• Home
  • Categories
  • Pricing
  • Submit
    Built with
    Ever Works
    Ever Works

    Connect with us

    Stay Updated

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

    Product

    • Categories
    • 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
    Decorative pattern
    Decorative pattern
    1. Home
    2. Research Papers & Surveys
    3. BLISS — A Billion Scale Index using Iterative Re-partitioning

    BLISS — A Billion Scale Index using Iterative Re-partitioning

    SIGKDD 2022 paper introducing BLISS, a billion-scale indexing method using iterative re-partitioning for large-scale approximate nearest neighbor search.

    Overview

    BLISS introduces a billion-scale indexing approach using iterative re-partitioning for efficient approximate nearest neighbor search on massive vector datasets.

    Key Contributions

    • Iterative re-partitioning strategy for billion-scale datasets
    • Balances cluster sizes for improved search efficiency
    • Addresses scalability challenges in large vector search
    • Published in SIGKDD 2022

    Publication

    • Venue: SIGKDD 2022
    • Authors: Gupta et al.
    • Abbreviation: BLISS

    Features

    • Handles billion-scale vector datasets
    • Iterative partitioning to balance workload
    • Efficient search through hierarchical organization
    Surveys

    Loading more......

    Information

    Websitedl.acm.org
    PublishedApr 4, 2026

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    3 Items
    #billion-scale#distributed#partitions

    Similar Products

    6 result(s)

    Milvus

    Milvus is a high-performance, open-source vector database designed for managing massive-scale embedding vectors in AI applications. It excels in similarity search using advanced indexing like HNSW and IVF, supports distributed deployment for billions of vectors, GPU acceleration, and hybrid search combining vector and scalar filters. Key use cases include RAG pipelines, recommendation engines, and image/video retrieval; it outperforms single-node DBs like Faiss in scalability but requires more setup compared to managed options like Pinecone.

    HugeGraph

    Apache's distributed graph database from Baidu with vector search capabilities via HNSW and DiskANN indexes, supporting billion-scale graph + vector workloads for fraud detection and knowledge graphs.

    Manu — A Cloud Native Vector Database Management System

    VLDB 2022 paper introducing Manu, a cloud-native vector database management system designed for scalable similarity search in cloud environments with separated storage and compute architecture.

    DIMS — Distributed Index for Similarity Search in Metric Spaces

    TKDE 2024 paper presenting DIMS, a distributed indexing method for efficient similarity search across metric spaces. The approach enables parallel processing of vector similarity queries at scale.

    ELPIS — Graph-Based Similarity Search for Scalable Data Science

    VLDB 2023 paper presenting ELPIS, a graph-based similarity search approach that combines graph indexing with learning-based techniques for scalable data science applications on large datasets.

    Hercules — Against Data Series Similarity Search

    VLDB 2022 paper introducing Hercules, an approach for efficient data series (time series) similarity search at scale, leveraging advanced indexing and pruning techniques for billion-scale sequence datasets.