DBScholar

Back to papers

MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search

Summary: Mixed Incremental Refinement Graphs (MIRAGE-ANNS) merges refinement-based construction with incremental inserts for ANNS. Delivers state-of-the-art construction and query performance, up to 2x throughput on real datasets, enabling RAG-backed LLM retrieval. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h21af6127a39d45d8
Venue
SIGMOD
Year
2025
Pagerank
5.9583046e-05
Overall Rank
5,886 | 60.43%
DOI
10.1145/3725325

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{voruganti_sigmod25,
        title = {{MIRAGE-ANNS: Mixed Approach Graph-based Indexing for Approximate Nearest Neighbor Search}},
        author = {Voruganti, Sairaj and Özsu, M. Tamer},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725325},
        url = {https://dl.acm.org/doi/10.1145/3725325},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 15 of 15 cited papers.

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

Rank Cited Paper Year Venue Pagerank
20 Similarity Search in High Dimensions via Hashing 1999 VLDB 0.00057568153
74 Fast Approximate Nearest Neighbor Search With The Navigating Spreading-out Graph 2019 VLDB 0.00037091678
194 Milvus: A Purpose-Built Vector Data Management System 2021 SIGMOD 0.00025636725
298 Query-Aware Locality-Sensitive Hashing for Approximate Nearest Neighbor Search 2016 VLDB 0.00021833987
338 Locality-Sensitive Hashing Scheme Based on Dynamic Collision Counting 2012 SIGMOD 0.00020585187
345 A Comprehensive Survey and Experimental Comparison of Graph-Based Approximate Nearest Neighbor Search 2021 VLDB 0.00020445545
562 SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index 2015 VLDB 0.00016335405
1,225 ACORN: Performant and Predicate-Agnostic Search Over Vector Embeddings and Structured Data 2024 SIGMOD 0.00011444398
1,373 High-Throughput Vector Similarity Search in Knowledge Graphs 2023 SIGMOD 0.0001088854
1,601 High-Dimensional Approximate Nearest Neighbor Search: with Reliable and Efficient Distance Comparison Operations 2023 SIGMOD 0.00010103316
1,625 Towards Efficient Index Construction and Approximate Nearest Neighbor Search in High-Dimensional Spaces 2023 VLDB 0.0001004502
1,684 HVS: Hierarchical Graph Structure Based on Voronoi Diagrams for Solving Approximate Nearest Neighbor Search 2022 VLDB 9.8801753e-05
2,726 iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search 2024 SIGMOD 8.0904995e-05
2,871 Graph-Based Vector Search: An Experimental Evaluation of the State-of-the-Art 2025 SIGMOD 7.9229231e-05
4,050 Revisiting the Index Construction of Proximity Graph-Based Approximate Nearest Neighbor Search 2025 VLDB 6.8298981e-05
Previous Page 1 / 1 Next

Semantically Similar Papers