[1] A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. https://github.com/Lsyhprum/WEAVESS/tree/dev/dataset, 2021.
[2] Akhil Arora, Sakshi Sinha, Piyush Kumar, and Arnab Bhattacharya. Hd-index: Pushing the scalability-accuracy boundary for approximate knn search in high-dimensional spaces.  $PVLDB$ , 11(8):906–919, 2018.
[3] Jianmin Bao, Dong Chen, Fang Wen, Houqiang Li, and Gang Hua. Towards open-set identity preserving face synthesis. In CVPR, pages 6713-6722, 2018.
[4] Dmitry Baranchuk, Dmitry Persiyanov, Anton Sinitsin, and Artem Babenko. Learning to route in similarity graphs. In ICML, volume 97, pages 475-484, 2019.
[5] Erik Bernhardsson, Martin Aumüller, and Alexander Faithfull. Benchmarking nearest neighbors. https://github.com/erikbern/ann-benchmarks, 2018.
[6] Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán, Maria Saumell, and David R Wood. Proximity graphs: E,  $\delta$ ,  $\delta$ ,  $\chi$  and  $\omega$ . International Journal of Computational Geometry & Applications, 22(05):439-469, 2012.
[7] Antoine Boutet, Anne-Marie Kermarrec, Nupur Mittal, and François Taiani. Being prepared in a sparse world: The case of KNN graph construction. In ICDE, pages 241-252, 2016.
[8] Patrick Chen, Wei-Cheng Chang, Jyun-Yu Jiang, Hsiang-Fu Yu, Inderjit Dhillon, and Cho-Jui Hsieh. Finger: Fast inference for graph-based approximate nearest neighbor search. In WWW, pages 3225-3235, 2023.
[9] Qi Chen, Bing Zhao, Haidong Wang, Mingqin Li, Chuanjie Liu, Zengzhong Li, Mao Yang, and Jingdong Wang. SPANN: highly-efficient billion-scale approximate nearest neighborhood search. In NeurIPS, pages 5199-5212, 2021.
[10] Shivani Choudhary, Tarun Luthra, Ashima Mittal, and Rajat Singh. A survey of knowledge graph embedding and their applications. CoRR, abs/2107.07842, 2021.
[11] Benjamin Coleman, Santiago Segarra, Alexander J Smola, and Anshumali Shrivastava. Graph reordering for cache-efficient near neighbor search. In NeurIPS, pages 38488-38500, 2022.
[12] John P. Collomosse, Tu Bui, and Hailin Jin. Livesketch: Query perturbations for guided sketch-based visual search. In CVPR, pages 2879-2887, 2019.
[13] Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. Bert: Pre-training of deep bidirectional transformers for language understanding. CoRR, abs/1810.04805, 2018.
[14] Wei Dong, Moses Charikar, and Kai Li. Efficient k-nearest neighbor graph construction for generic similarity measures. In WWW, pages 577-586, 2011.
[15] Karima Echihabi. High-dimensional vector similarity search: From time series to deep network embeddings. In SIGMOD, pages 2829-2832, 2020.
[16] Karima Echihabi, Kostas Zoumpatianos, and Themis Palpanas. High-dimensional similarity search for scalable data science. In ICDE, pages 2369-2372, 2021.
[17] Facebook. A library for efficient similarity search and clustering of dense vectors. https://github.com/facebookresearch/faiss, 2018.
[18] Cong Fu, Changxu Wang, and Deng Cai. High dimensional similarity search with satellite system graph: Efficiency, scalability, and unindexed query compatibility. TPAMI, 2021.
[19] Cong Fu, Chao Xiang, Changxu Wang, and Deng Cai. Fast approximate nearest neighbor search with the navigating spreading-out graph. PVLDB, 12(5):461-474, 2019.
[20] Aristides Gionis, Piotr Indyk, and Rajeev Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518-529, 1999.