{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:26:58Z","timestamp":1759883218760,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032060686","type":"print"},{"value":"9783032060693","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T00:00:00Z","timestamp":1759881600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-06069-3_33","type":"book-chapter","created":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T15:54:28Z","timestamp":1759852468000},"page":"403-414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Overview of\u00a0the\u00a0SISAP 2025 Indexing Challenge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5804-9868","authenticated-orcid":false,"given":"Eric\u00a0S.","family":"Tellez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0148-695X","authenticated-orcid":false,"given":"Edgar","family":"Chavez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7212-6476","authenticated-orcid":false,"given":"Martin","family":"Aum\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8813-303X","authenticated-orcid":false,"given":"Vladimir","family":"Mic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,8]]},"reference":[{"key":"33_CR1","unstructured":"Bustos, B., Chen, J.: SISAP indexing challenge 2025 \u2013 solution for task 2 using root join. In: Amato, G., et al. (eds.) SISAP 2025. LNCS, vol. 16134, pp. xx\u2013yy. Springer, Heidelberg (2025)"},{"issue":"6","key":"33_CR2","doi-asserted-by":"publisher","first-page":"7462","DOI":"10.1016\/j.eswa.2010.12.077","volume":"38","author":"HL Chen","year":"2011","unstructured":"Chen, H.L., Chang, Y.I.: All-nearest-neighbors finding based on the Hilbert curve. Expert Syst. Appl. 38(6), 7462\u20137475 (2011)","journal-title":"Expert Syst. Appl."},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Cuconasu, F., et al.: The power of noise: redefining retrieval for rag systems. In: Proceedings of the 47th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 719\u2013729 (2024)","DOI":"10.1145\/3626772.3657834"},{"key":"33_CR4","unstructured":"Dearle, A., Connor, R., Claydon, B., McKeogh, F.: Building a near-neighbour table using equi-voronoi polytopes. In: SISAP 2025. Springer, Heidelberg (2025)"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Dong, W., Moses, C., Li, K.: Efficient k-nearest neighbor graph construction for generic similarity measures. In: Proceedings of the 20th International Conference on World Wide Web, pp. 577\u2013586 (2011)","DOI":"10.1145\/1963405.1963487"},{"key":"33_CR6","unstructured":"Douze, M., et al.: The Faiss library. CoRR abs\/2401.08281 (2024)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"101510","DOI":"10.1016\/j.is.2020.101510","volume":"91","author":"S Ferrada","year":"2020","unstructured":"Ferrada, S., Bustos, B., Reyes, N.: An efficient algorithm for approximated self-similarity joins in metric spaces. Inf. Syst. 91, 101510 (2020)","journal-title":"Inf. Syst."},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-031-46994-7_25","volume-title":"Similarity Search and Applications","author":"C Foster","year":"2023","unstructured":"Foster, C., Kimia, B.: Computational enhancements of HNSW targeted to very large datasets. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP 2023. LNCS, vol. 14289, pp. 291\u2013299. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-46994-7_25"},{"key":"33_CR9","unstructured":"Foster, C., Magdaleno-Gatica, S., Kimia, B.: Refinement-based graph construction for search in low-memory systems. In: Amato, G., et al. (eds.) SISAP 2025. LNCS, vol. 16134, pp. xx\u2013yy. Springer, Heidelberg (2025)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Higuchi, N., Imamura, Y., Kuboyama, T., Hirata, K., Shinohara, T.: Fast nearest neighbor search with narrow 16-bit sketch. In: ICPRAM, pp. 540\u2013547 (2019)","DOI":"10.5220\/0007377705400547"},{"key":"33_CR11","unstructured":"Higuchi, N., Imamura, Y., Shinohara, T., Hirata, K., Kuboyama, T.: Double filtering using short and long quantized projections. In: Amato, G., et al. (eds.) SISAP 2025. LNCS, vol. 16134, pp. xx\u2013yy. Springer, Heidelberg (2025)"},{"key":"33_CR12","unstructured":"J\u00e4\u00e4saari, E., Hyv\u00f6nen, V., Ceccarello, M., Roos, T., Aum\u00fcller, M.: VIBE: vector index benchmark for embeddings. CoRR abs\/2505.17810 (2025)"},{"issue":"3","key":"33_CR13","first-page":"20","volume":"48","author":"R Krishnaswamy","year":"2024","unstructured":"Krishnaswamy, R., Manohar, M.D., Simhadri, H.V.: The diskann library: graph-based indices for fast, fresh and filtered vector search. IEEE Data Eng. Bull. 48(3), 20\u201342 (2024)","journal-title":"IEEE Data Eng. Bull."},{"key":"33_CR14","unstructured":"Lou, Y., Ma, L., Luo, K., Ruan, Y., Wu, H., Lu, M., Mao, R.: Efficient Faiss-based k-NN indexing for SISAP 2025 challenge. In: SISAP 2025. Springer, Heidelberg (2025)"},{"issue":"4","key":"33_CR15","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2018","unstructured":"Malkov, Y.A., Yashunin, D.A.: Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs. IEEE Trans. Pattern Anal. Mach. Intell. 42(4), 824\u2013836 (2018)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-32153-5_10","volume-title":"Similarity Search and Applications","author":"Y Malkov","year":"2012","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Scalable distributed algorithm for approximate nearest neighbor search problem in high dimensional general metric spaces. In: Navarro, G., Pestov, V. (eds.) SISAP 2012. LNCS, vol. 7404, pp. 132\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32153-5_10"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"McInnes, L., Healy, J., Melville, J.: UMAP: uniform manifold approximation and projection for dimension reduction. arXiv preprint arXiv:1802.03426 (2018)","DOI":"10.21105\/joss.00861"},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/s007780200060","volume":"11","author":"G Navarro","year":"2002","unstructured":"Navarro, G.: Searching in metric spaces by spatial approximation. VLDB J. 11(1), 28\u201346 (2002)","journal-title":"VLDB J."},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Reimers, N., Gurevych, I.: Sentence-BERT: sentence embeddings using Siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing. Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/D19-1410"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-031-75823-2_21","volume-title":"Similarity Search and Applications","author":"ES Tellez","year":"2023","unstructured":"Tellez, E.S., Aum\u00fcller, M., Chavez, E.: Overview of the SISAP 2024 indexing challenge. In: Ch\u00e1vez, E., Kimia, B., Loko\u010d, J., Patella, M., Sedmidubsky, J. (eds.) SISAP 2024. LNCS, vol. 15268, pp. 255\u2013264. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-75823-2_21"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-031-75823-2_21","volume-title":"Similarity Search and Applications","author":"ES Tellez","year":"2024","unstructured":"Tellez, E.S., Aum\u00fcller, M., Mic, V.: Overview of the SISAP 2024 indexing challenge. In: Ch\u00e1vez, E., Kimia, B., Loko\u010d, J., Patella, M., Sedmidubsky, J. (eds.) SISAP 2024. LNCS, vol. 15268, pp. 255\u2013265. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-75823-2_21"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Tellez, E.S., Ruiz, G.: Similaritysearch.jl: autotuned nearest neighbor indexes for Julia. J. Open Sour. Softw. 7(75), 4442 (2022)","DOI":"10.21105\/joss.04442"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06069-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T15:54:37Z","timestamp":1759852477000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06069-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,8]]},"ISBN":["9783032060686","9783032060693"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06069-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,8]]},"assertion":[{"value":"8 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All authors certify that they have no affiliations with or involvement in any organization or entity with any financial interest or non-financial interest in the subject matter or materials discussed in this manuscript.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Reykjavik","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iceland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}