HARMONY: A Scalable Distributed Vector Database for High-Throughput Approximate Nearest Neighbor Search
Summary: Harmony: distributed ANNS with a multi-gran partition (dimension-based + vector-based) for balanced load, reduced comms. Early-stop pruning leverages distance monotonicity to prune, delivering 4.63x throughput on 4 nodes and 58% gains on skewed workloads. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qian Xu
- 2. Feng Zhang
- 3. Chengxi Li
- 4. Lei Cao
- 5. Zheng Chen
- 6. Jidong Zhai
- 7. Xiaoyong Du
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,237 | Quantization Meets Projection: A Happy Marriage for Approximate k-Nearest Neighbor Search | 2026 | VLDB | 4.1945683e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 11 of 11 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next