Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.14707

Help | Advanced Search

Computer Science > Databases

arXiv:2506.14707 (cs)
[Submitted on 18 Jun 2025 ]

Title: HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search

Title: HARMONY:一种可扩展的分布式向量数据库,用于高吞吐量近似最近邻搜索

Authors:Qian Xu, Feng Zhang, Chengxi Li, Lei Cao, Zheng Chen, Jidong Zhai, Xiaoyong Du
Abstract: Approximate Nearest Neighbor Search (ANNS) is essential for various data-intensive applications, including recommendation systems, image retrieval, and machine learning. Scaling ANNS to handle billions of high-dimensional vectors on a single machine presents significant challenges in memory capacity and processing efficiency. To address these challenges, distributed vector databases leverage multiple nodes for the parallel storage and processing of vectors. However, existing solutions often suffer from load imbalance and high communication overhead, primarily due to traditional partition strategies that fail to effectively distribute the workload. In this paper, we introduce Harmony, a distributed ANNS system that employs a novel multi-granularity partition strategy, combining dimension-based and vector-based partition. This strategy ensures a balanced distribution of computational load across all nodes while effectively minimizing communication costs. Furthermore, Harmony incorporates an early-stop pruning mechanism that leverages the monotonicity of distance computations in dimension-based partition, resulting in significant reductions in both computational and communication overhead. We conducted extensive experiments on diverse real-world datasets, demonstrating that Harmony outperforms leading distributed vector databases, achieving 4.63 times throughput on average in four nodes and 58% performance improvement over traditional distribution for skewed workloads.
Abstract: 近似最近邻搜索(ANNS)对于推荐系统、图像检索和机器学习等各种数据密集型应用至关重要。在单台机器上扩展ANNS以处理数十亿个高维向量,在内存容量和处理效率方面带来了重大挑战。 为了解决这些挑战,分布式向量数据库利用多个节点进行向量的并行存储和处理。然而,现有的解决方案通常会遇到负载不平衡和高通信开销的问题,这主要是由于传统的分区策略无法有效分配工作负载。 本文介绍了一种名为Harmony的分布式ANNS系统,该系统采用了一种新颖的多粒度分区策略,结合了基于维度和基于向量的分区方法。此策略确保了所有节点之间的计算负载均衡,并有效减少了通信成本。 此外,Harmony还引入了一种早期停止剪枝机制,利用基于维度分区的距离计算单调性,显著降低了计算和通信开销。我们在各种真实世界的数据集上进行了广泛的实验,结果表明Harmony优于领先的分布式向量数据库,在四节点情况下平均吞吐量提高了4.63倍,并且在偏斜工作负载下比传统分布方式性能提升了58%。
Subjects: Databases (cs.DB)
Cite as: arXiv:2506.14707 [cs.DB]
  (or arXiv:2506.14707v1 [cs.DB] for this version)
  https://doi.org/10.48550/arXiv.2506.14707
arXiv-issued DOI via DataCite

Submission history

From: Qian Xu [view email]
[v1] Wed, 18 Jun 2025 00:56:36 UTC (466 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.DB
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号