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
- 7477
- Venue
- SIGMOD
- Year
- 2026
- Pagerank
- 4.1945683e-05
- Overall Rank
- 10,166 | 29.28%
- DOI
-
10.1145/3786651
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
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 |
| 212 |
Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph |
2019 |
VLDB |
0.00033913475 |
| 495 |
Milvus: A Purpose-Built Vector Data Management System |
2021 |
SIGMOD |
0.00021767688 |
| 562 |
Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search |
2016 |
VLDB |
0.00020091752 |
| 770 |
A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search |
2021 |
VLDB |
0.00016917602 |
| 867 |
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index |
2015 |
VLDB |
0.00015792021 |
| 2,023 |
Efficient Approximate Nearest Neighbor Search in Multi-dimensional Databases |
2023 |
SIGMOD |
9.7544991e-05 |
| 3,680 |
SingleStore-V: An Integrated Vector Database System in SingleStore |
2024 |
VLDB |
6.8496415e-05 |
| 4,731 |
Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art |
2025 |
SIGMOD |
5.966659e-05 |
| 5,129 |
Navigating Labels and Vectors: A Unified Approach to Filtered Approximate Nearest Neighbor Search |
2024 |
SIGMOD |
5.6755204e-05 |
| 5,352 |
Permutation Search Methods are Efficient, Yet Faster Search is Possible |
2015 |
VLDB |
5.5529869e-05 |
| 5,569 |
Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search |
2025 |
VLDB |
5.4290942e-05 |
| 7,544 |
A Topology-Aware Localized Update Strategy for Graph-Based ANN Index |
2026 |
VLDB |
4.7149033e-05 |
| 8,209 |
VSAG: An Optimized Search Framework for Graph-based Approximate Nearest Neighbor Search |
2025 |
VLDB |
4.5581054e-05 |
| 8,485 |
Maximum Inner Product is Query-Scaled Nearest Neighbor |
2025 |
VLDB |
4.4999394e-05 |
Semantically Similar Papers