{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:01Z","timestamp":1783576981295,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":31,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819620531","type":"print"},{"value":"9789819620548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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-981-96-2054-8_25","type":"book-chapter","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T15:48:20Z","timestamp":1735832900000},"page":"333-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dynamic Exploration Graph: A Novel Approach for\u00a0Efficient Nearest Neighbor Search in\u00a0Evolving Multimedia Datasets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3957-4672","authenticated-orcid":false,"given":"Nico","family":"Hezel","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6309-572X","authenticated-orcid":false,"given":"Kai Uwe","family":"Barthel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7021-7311","authenticated-orcid":false,"given":"Bruno","family":"Schilling","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3548-0537","authenticated-orcid":false,"given":"Konstantin","family":"Schall","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3600-6848","authenticated-orcid":false,"given":"Klaus","family":"Jung","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,3]]},"reference":[{"key":"25_CR1","unstructured":"Aguerrebere, C., Hildebrand, M., Bhati, I.S., Willke, T., Tepper, M.: Locally-adaptive quantization for streaming vector search (2024). https:\/\/arxiv.org\/abs\/2402.02044"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Baranchuk, D., Douze, M., Upadhyay, Y., Yalniz, I.Z.: Dedrift: robust similarity search under content drift. In: ICCV, pp. 10992\u201311001. IEEE (2023)","DOI":"10.1109\/ICCV51070.2023.01012"},{"key":"25_CR3","doi-asserted-by":"publisher","unstructured":"Chen, P., Chang, W.C., Jiang, J.Y., Yu, H.F., Dhillon, I., Hsieh, C.J.: Finger: fast inference for graph-based approximate nearest neighbor search. In: Proceedings of the ACM Web Conference 2023, WWW 2023, pp. 3225\u20133235. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3543507.3583318","DOI":"10.1145\/3543507.3583318"},{"issue":"1\u20136","key":"25_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1524\/zkri.1933.84.1.109","volume":"84","author":"B Delaunay","year":"1933","unstructured":"Delaunay, B.: Neue darstellung der geometrischen kristallographie. Zeitschrift f\u00fcr Kristallographie - Crystalline Materials 84(1\u20136), 109\u2013149 (1933). https:\/\/doi.org\/10.1524\/zkri.1933.84.1.109","journal-title":"Zeitschrift f\u00fcr Kristallographie - Crystalline Materials"},{"key":"25_CR5","unstructured":"Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Scientiarum Imperialis Petropolitanae 8, 128\u2013140 (1736)"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"12140","DOI":"10.1038\/s41598-017-11873-y","volume":"7","author":"E Facco","year":"2017","unstructured":"Facco, E., d\u2019Errico, M., Rodriguez, A., Laio, A.: Estimating the intrinsic dimension of datasets by a minimal neighborhood information. Sci. Rep. 7(1), 12140 (2017). https:\/\/doi.org\/10.1038\/s41598-017-11873-y","journal-title":"Sci. Rep."},{"issue":"8","key":"25_CR7","doi-asserted-by":"publisher","first-page":"4139","DOI":"10.1109\/TPAMI.2021.3067706","volume":"44","author":"C Fu","year":"2022","unstructured":"Fu, C., Wang, C., Cai, D.: High dimensional similarity search with satellite system graph: efficiency, scalability, and unindexed query compatibility. IEEE Trans. Pattern Anal. Mach. Intell. 44(8), 4139\u20134150 (2022). https:\/\/doi.org\/10.1109\/TPAMI.2021.3067706","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"5","key":"25_CR8","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":"25_CR9","doi-asserted-by":"publisher","unstructured":"Gao, J., Long, C.: High-dimensional approximate nearest neighbor search: with reliable and efficient distance comparison operations. Proc. ACM Manag. Data 1(2) (2023). https:\/\/doi.org\/10.1145\/3589282","DOI":"10.1145\/3589282"},{"key":"25_CR10","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., et al. (eds.) ICMR, pp. 657\u2013665. ACM (2024)","DOI":"10.1145\/3652583.3658117"},{"key":"25_CR11","first-page":"18","volume":"3","author":"M Iwasaki","year":"2010","unstructured":"Iwasaki, M.: Proximity search in metric spaces using approximate k nearest neighbor graph. IPSJ Trans. Database 3, 18\u201328 (2010)","journal-title":"IPSJ Trans. Database"},{"key":"25_CR12","unstructured":"Jayaram\u00a0Subramanya, S., Devvrit, F., Simhadri, H.V., Krishnawamy, R., Kadekodi, R.: Diskann: fast accurate billion-point nearest neighbor search on a single node. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9-Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a032. Curran Associates, Inc. (2019)"},{"issue":"1","key":"25_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE Trans. Pattern Anal. Mach. Intell. 33(1), 117\u2013128 (2011)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"8","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TKDE.2019.2909204","volume":"32","author":"W Li","year":"2020","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8), 1475\u20131488 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"25_CR15","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":"25_CR16","doi-asserted-by":"publisher","unstructured":"Mastelini, S.M., Veloso, B., Halford, M., de\u00a0Leon Ferreira\u00a0de Carvalho, A.C.P., Gama, J.: Swinn: efficient nearest neighbor search in sliding windows using graphs. Inf. Fusion 101, 101979 (2024). https:\/\/doi.org\/10.1016\/j.inffus.2023.101979","DOI":"10.1016\/j.inffus.2023.101979"},{"key":"25_CR17","unstructured":"Oguri, Y., Matsui, Y.: Theoretical and empirical analysis of adaptive entry point selection for graph-based approximate nearest neighbor search. arXiv abs\/2402.04713 (2024)"},{"key":"25_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11575832_14","volume-title":"String Processing and Information Retrieval","author":"R Paredes","year":"2005","unstructured":"Paredes, R., Ch\u00e1vez, E.: Using the k-nearest neighbor graph for proximity searching in metric spaces. In: Consens, M., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 127\u2013138. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11575832_14"},{"issue":"5","key":"25_CR19","doi-asserted-by":"publisher","first-page":"2303","DOI":"10.1007\/s00521-023-08920-3","volume":"36","author":"H Peng","year":"2023","unstructured":"Peng, H.: Quantization to speedup approximate nearest neighbor search. Neural Comput. Appl. 36(5), 2303\u20132313 (2023). https:\/\/doi.org\/10.1007\/s00521-023-08920-3","journal-title":"Neural Comput. Appl."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.D.: Glove: global vectors for word representation. In: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1532\u20131543 (2014)","DOI":"10.3115\/v1\/D14-1162"},{"key":"25_CR21","unstructured":"Radford, A., et al.: Learning transferable visual models from natural language supervision. In: Meila, M., Zhang, T. (eds.) ICML. Proceedings of Machine Learning Research, vol.\u00a0139, pp. 8748\u20138763. PMLR (2021)"},{"key":"25_CR22","unstructured":"Singh, A., Subramanya, S.J., Krishnaswamy, R., Simhadri, H.V.: Freshdiskann: a fast and accurate graph-based ANN index for streaming similarity search. arXiv abs\/2105.09613 (2021)"},{"issue":"2","key":"25_CR23","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/0095-8956(74)90054-9","volume":"16","author":"S Toida","year":"1974","unstructured":"Toida, S.: Construction of quartic graphs. J. Comb. Theory Ser. B 16(2), 124\u2013133 (1974). https:\/\/doi.org\/10.1016\/0095-8956(74)90054-9","journal-title":"J. Comb. Theory Ser. B"},{"issue":"4","key":"25_CR24","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980). https:\/\/doi.org\/10.1016\/0031-3203(80)90066-7","journal-title":"Pattern Recogn."},{"issue":"6","key":"25_CR25","doi-asserted-by":"publisher","first-page":"3759","DOI":"10.1007\/s11280-023-01204-9","volume":"26","author":"N Ukey","year":"2023","unstructured":"Ukey, N., Zhang, G., Yang, Z., Li, B., Li, W., Zhang, W.: Efficient continuous KNN join over dynamic high-dimensional data. World Wide Web (WWW) 26(6), 3759\u20133794 (2023)","journal-title":"World Wide Web (WWW)"},{"key":"25_CR26","doi-asserted-by":"publisher","unstructured":"Wang, M., Xu, X., Yue, Q., Wang, Y.: A comprehensive survey and experimental comparison of graph-based approximate nearest neighbor search. Proc. VLDB Endow. 14(11), 1964\u20131978 (2021). https:\/\/doi.org\/10.14778\/3476249.3476255","DOI":"10.14778\/3476249.3476255"},{"key":"25_CR27","doi-asserted-by":"publisher","unstructured":"Xu, Z., Zhao, W., Tan, S., Zhou, Z., Li, P.: Proximity graph maintenance for fast online nearest neighbor search. CoRR abs\/2206.10839 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.10839","DOI":"10.48550\/arXiv.2206.10839"},{"key":"25_CR28","doi-asserted-by":"publisher","unstructured":"Yandex, A.B., Lempitsky, V.: Efficient indexing of billion-scale datasets of deep descriptors. In: 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 2055\u20132063 (2016). https:\/\/doi.org\/10.1109\/CVPR.2016.226","DOI":"10.1109\/CVPR.2016.226"},{"key":"25_CR29","unstructured":"Yue, Q., Xu, X., Wang, Y., Tao, Y., Luo, X.: Routing-guided learned product quantization for graph-based approximate nearest neighbor search. CoRR abs\/2311.18724 (2023)"},{"key":"25_CR30","unstructured":"Zeng, X., Wu, Z., Hu, X., Shi, X., Sun, S., Zhang, S.: Candy: a benchmark for continuous approximate nearest neighbor search with dynamic data ingestion (2024). https:\/\/arxiv.org\/abs\/2406.19651"},{"key":"25_CR31","unstructured":"Zhao, W.L., Wang, H., Ngo, C.W.: Approximate k-NN graph construction: a generic online approach (2020). https:\/\/arxiv.org\/abs\/1804.03032"}],"container-title":["Lecture Notes in Computer Science","MultiMedia Modeling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-2054-8_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T01:42:52Z","timestamp":1742694172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-2054-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819620531","9789819620548"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-2054-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"3 January 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Multimedia Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"9 January 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 January 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mmm2025.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}