DBScholar

Back to papers

CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation

Summary: CMANNS accelerates NSG/HNSW construction by disaggregating dense distance computation (Tensor-Core GEMMs) from irregular graph memory operations. Hot-set locality and overlapped shard streaming scale beyond HBM, yielding up to 13.05× faster builds without changing query recall/latency. (summarized by gpt-5.6-luna on Jul 26 2026)

Paper ID
h5f8b4dba6fd6b453
Venue
SIGMOD
Year
2026
Pagerank
4.9793485e-05
Overall Rank
10,425 | 29.91%
DOI
10.1145/3802027

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{huan_sigmod26,
        title = {{CMANNS: GPU-Accelerated Graph Index Construction for ANNS via Compute-Memory Disaggregation}},
        author = {Huan, Chengying and Yao, Renjie and Ma, Shaonan and Gu, Rong and Yang, Zhengyi and Chen, Lizheng and Wang, Zhibin and Zhang, Mingxing and Xi, Fang and Chen, Guihai and Tian, Chen},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3802027},
        url = {https://dl.acm.org/doi/10.1145/3802027},
        year = {2026}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
2 R-Trees: A Dynamic Index Structure For Spatial Searching 1984 SIGMOD 0.001992968
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
45 A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces 1998 VLDB 0.0004503446
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
341 AnalyticDB-V: A Hybrid Analytical Engine Towards Query Fusion for Structured and Unstructured Data 2020 VLDB 0.00020539791
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
2,265 ELPIS: Graph-Based Similarity Search for Scalable Data Science 2023 VLDB 8.7238222e-05
2,448 DeltaPQ: Lossless Product Quantization Code Compression for High Dimensional Similarity Search 2020 VLDB 8.4494625e-05
2,783 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 8.0242863e-05
2,871 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9229231e-05
3,385 SymphonyQG: Towards Symphonious Integration of Quantization and Graph for Approximate Nearest Neighbor Search 2025 SIGMOD 7.3548612e-05
5,411 GTS: GPU-based Tree Index for Fast Similarity Search 2024 SIGMOD 6.1408042e-05
5,886 MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search 2025 SIGMOD 5.9583046e-05
6,895 Chameleon: a Heterogeneous and Disaggregated Accelerator System for Retrieval-Augmented Language Models 2025 VLDB 5.6536466e-05
7,004 Accelerating Graph Indexing for ANNS on Modern CPUs 2025 SIGMOD 5.6238624e-05
9,551 Fast Graph Vector Search via Hardware Acceleration and Delayed-Synchronization Traversal 2025 VLDB 5.1591583e-05
9,955 Turbocharging Vector Databases using Modern SSDs 2025 VLDB 5.1038322e-05
Previous Page 1 / 1 Next

Semantically Similar Papers