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

    d-HNSW

    An efficient vector search system designed for disaggregated memory architectures. d-HNSW optimizes HNSW for environments where compute and memory are separated, typical in modern cloud and distributed systems.

    🌐Visit Website

    About this tool

    Overview

    Published in May 2025 (arXiv:2505.11783), d-HNSW addresses efficient vector search in disaggregated memory architectures where compute nodes access memory over network.

    Disaggregated Memory Architecture

    Modern cloud systems increasingly separate:

    • Compute: CPU/GPU processing
    • Memory: Remote memory accessed over network (RDMA)
    • Storage: Persistent data

    This enables flexible resource allocation but challenges traditional algorithms.

    Key Innovations

    Network-Aware Traversal: Optimizes HNSW graph traversal for network latency

    Prefetching: Anticipates needed nodes and fetches in batches

    Caching: Intelligent caching of frequently accessed graph regions

    Batching: Groups operations to amortize network overhead

    Benefits

    • Efficient use of disaggregated resources
    • Scalability beyond single-node memory
    • Cost optimization in cloud environments
    • Flexibility in resource allocation

    Use Cases

    • Cloud-native vector databases
    • Kubernetes-based deployments
    • Serverless vector search
    • Multi-tenant systems with resource sharing

    Availability

    ArXiv preprint arXiv:2505.11783 (2025)

    Surveys

    Loading more......

    Information

    Websitearxiv.org
    PublishedMar 20, 2026

    Categories

    1 Item
    Research Papers & Surveys

    Tags

    4 Items
    #Hnsw#Distributed#Cloud Native#Optimization

    Similar Products

    6 result(s)
    Transwarp Hippo

    Transwarp Hippo is an enterprise-grade, cloud-native distributed vector database designed for scalable vector operations, including similarity search and clustering, targeting massive datasets and real-time recommendation systems.

    Curator

    An efficient indexing approach for multi-tenant vector databases that handles low-selectivity filters effectively. Curator addresses the challenge of maintaining high performance when serving multiple tenants with filtered vector search queries.

    Faster Maximum Inner Product Search in High Dimensions

    A 2022 research paper presenting algorithms for faster MIPS (Maximum Inner Product Search) in high-dimensional spaces. MIPS is crucial for recommendation systems, neural networks, and various machine learning applications.

    Monte Carlo Tree Search for Vector Indexing

    Research on using Monte Carlo Tree Search algorithms for optimizing vector index construction and search strategies. Explores adaptive decision-making during graph building and query routing.

    OrchANN

    A unified I/O orchestration framework for skewed out-of-core vector search that addresses the challenge of billion-scale ANN search when the dataset exceeds available memory. OrchANN optimizes I/O operations for graph-based indexes stored on disk.

    Pyramid Product Quantization

    An advanced vector compression technique for approximate nearest neighbor search that improves upon traditional product quantization by using a hierarchical pyramid structure. Published in 2026, it achieves better compression ratios while maintaining search accuracy.

    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