{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:29:35Z","timestamp":1745468975789,"version":"3.40.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031758225"},{"type":"electronic","value":"9783031758232"}],"license":[{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T00:00:00Z","timestamp":1729814400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-75823-2_24","type":"book-chapter","created":{"date-parts":[[2024,10,24]],"date-time":"2024-10-24T20:33:24Z","timestamp":1729802004000},"page":"283-290","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Adapting the Exploration Graph for High Throughput in Low Recall Regimes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3957-4672","authenticated-orcid":false,"given":"Nico","family":"Hezel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7021-7311","authenticated-orcid":false,"given":"Bruno","family":"Schilling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6309-572X","authenticated-orcid":false,"given":"Kai Uwe","family":"Barthel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3548-0537","authenticated-orcid":false,"given":"Konstantin","family":"Schall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3600-6848","authenticated-orcid":false,"given":"Klaus","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,25]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101774","volume":"100","author":"M Antol","year":"2021","unstructured":"Antol, M., Ol\u2019ha, J., Slanin\u00e1kov\u00e1, T., Dohnal, V.: Learned metric index\u2014proposition of learned indexing for unstructured data. Inf. Syst. 100, 101774 (2021)","journal-title":"Inf. Syst."},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1038\/nphys1130","volume":"5","author":"M Bogu\u00f1\u00e1","year":"2009","unstructured":"Bogu\u00f1\u00e1, M., Krioukov, D., Claffy, K.C.: Navigability of complex networks. Nat. Phys. 5(1), 74\u201380 (2009)","journal-title":"Nat. Phys."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Foster, C., Kimia, B.B.: Computational enhancements of HNSW targeted to very large datasets. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP. Lecture Notes in Computer Science, vol. 14289, pp. 291\u2013299. Springer, Berlin (2023)","DOI":"10.1007\/978-3-031-46994-7_25"},{"issue":"5","key":"24_CR4","doi-asserted-by":"publisher","first-page":"461","DOI":"10.14778\/3303753.3303754","volume":"12","author":"C Fu","year":"2019","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. Proc. VLDB Endow. 12(5), 461\u2013474 (2019)","journal-title":"Proc. VLDB Endow."},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Hezel, N., Barthel, K.U., Schall, K., Jung, K.: An exploration graph with continuous refinement for efficient multimedia retrieval. In: Gurrin, C., Kongkachandra, R., Schoeffmann, K., Dang-Nguyen, D.T., Rossetto, L., Satoh, S., Zhou, L. (eds.) ICMR, pp. 657\u2013665. ACM (2024)","DOI":"10.1145\/3652583.3658117"},{"issue":"4","key":"24_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","volume":"42","author":"YA Malkov","year":"2020","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 (2020)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Oguri, Y., Matsui, Y.: General and practical tuning method for off-the-shelf graph-based index: SISAP indexing challenge report by team UTokyo. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP. Lecture Notes in Computer Science, vol. 14289, pp. 273\u2013281. Springer, Berlin (2023)","DOI":"10.1007\/978-3-031-46994-7_23"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the k-nearest neighbor graph for proximity searching in metric spaces. In: Consens, M.P., Navarro, G. (eds.) SPIRE. Lecture Notes in Computer Science, vol.\u00a03772, pp. 127\u2013138. Springer, Berlin (2005)","DOI":"10.1007\/11575832_14"},{"key":"24_CR9","unstructured":"Schuhmann, C., Beaumont, R., Vencu, R., Gordon, C., Wightman, R., Cherti, M., Coombes, T., Katta, A., Mullis, C., Wortsman, M., Schramowski, P., Kundurthy, S., Crowson, K., Schmidt, L., Kaczmarczyk, R., Jitsev, J.: Laion-5b: an open large-scale dataset for training next generation image-text models. In: Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS\u201922. Curran Associates Inc., Red Hook, NY, USA (2022)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Web-scale k-means clustering. In: Rappa, M., Jones, P., Freire, J., Chakrabarti, S. (eds.) WWW, pp. 1177\u20131178. ACM (2010)","DOI":"10.1145\/1772690.1772862"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-031-46994-7_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 2023 indexing challenge. In: Pedreira, O., Estivill-Castro, V. (eds.) Similarity Search and Applications, pp. 255\u2013264. Springer Nature, Cham (2023)"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Thordsen, E., Schubert, E.: An alternating optimization scheme for binary sketches for cosine similarity search. In: Pedreira, O., Estivill-Castro, V. (eds.) SISAP. Lecture Notes in Computer Science, vol. 14289, pp. 41\u201355. Springer, Berlin (2023)","DOI":"10.1007\/978-3-031-46994-7_4"}],"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-031-75823-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T17:05:29Z","timestamp":1745427929000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-75823-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,25]]},"ISBN":["9783031758225","9783031758232"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-75823-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,25]]},"assertion":[{"value":"25 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"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":"Providence, RI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.sisap.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}