DBScholar

Back to papers

FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search

Summary: FGIM studies a new problem for graph-based ANNS: merging multiple existing indexes into one, motivated by cluster consolidation and read-write contention in vector DBs. It uses cross-querying PGs→kNNG, refinement, and kNNG→PG conversion to preserve connectivity/navigability, speeding merges up to 3.5x over HNSW incremental build. (summarized by gpt-5-mini on Apr 11 2026)

Paper ID
7668
Venue
SIGMOD
Year
2026
Pagerank
5.093636e-05
Overall Rank
10,455 | 28.27%
DOI
10.1145/3786651

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{wu_sigmod26,
        title = {{FGIM: a Fast Graph-based Indexes Merging Framework for Approximate Nearest Neighbor Search}},
        author = {Wu, Zekai and Jin, Jiabao and Cheng, Peng and Zhong, Xiaoyao and Chen, Lei and Tong, Yongxin and Shen, Zhitao and Song, Jingkuan and Shen, Heng Tao and Lin, Xuemin},
        series = {{SIGMOD} '26},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3786651},
        url = {https://dl.acm.org/doi/10.1145/3786651},
        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 14 of 14 cited papers.

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

Rank Cited Paper Year Venue Pagerank
93 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00034701237
286 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00022357911
332 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00020920444
398 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00019194947
580 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016157635
1,244 Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases 2023 SIGMOD 0.00011508159
2,920 SingleStore-V: An Integrated Vector Database System in SingleStore 2024 VLDB 7.9628307e-05
3,240 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.6071649e-05
3,335 Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search 2024 SIGMOD 7.5098031e-05
4,712 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.5506649e-05
4,970 Permutation Search Methods are Efficient, Yet Faster Search is Possible 2015 VLDB 6.4197336e-05
6,615 A Topology-Aware Localized Update Strategy for Graph-Based ANN Index 2026 VLDB 5.8214312e-05
6,851 Maximum Inner Product is Query-Scaled Nearest Neighbor 2025 VLDB 5.7546877e-05
8,205 VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search 2025 VLDB 5.4666548e-05
Previous Page 1 / 1 Next

Semantically Similar Papers