{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T10:11:04Z","timestamp":1781086264864,"version":"3.54.1"},"publisher-location":"Singapore","reference-count":28,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819608201","type":"print"},{"value":"9789819608218","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T00:00:00Z","timestamp":1734220800000},"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-0821-8_1","type":"book-chapter","created":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:04:48Z","timestamp":1734152688000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Verifiable Graph-Based Approximate Nearest Neighbor Search"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-5612-203X","authenticated-orcid":false,"given":"Chenzhao","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7117-3951","authenticated-orcid":false,"given":"Jilian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6300-8386","authenticated-orcid":false,"given":"Xuyang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kaimin","family":"Wei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bingwen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,12,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Aoyama, K., Ogawa, A., Hattori, T., Hori, T.: Double-layer neighborhood graph based similarity search for fast query-by-example spoken term detection. In: 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 5216\u20135220. IEEE (2015)","DOI":"10.1109\/ICASSP.2015.7178966"},{"key":"1_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006","volume":"87","author":"M Aum\u00fcller","year":"2020","unstructured":"Aum\u00fcller, M., Bernhardsson, E., Faithfull, A.: ANN-benchmarks: a benchmarking tool for approximate nearest neighbor algorithms. Inf. Syst. 87, 101374 (2020)","journal-title":"Inf. Syst."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Chen, J., Lin, H., Han, X., Sun, L.: Benchmarking large language models in retrieval-augmented generation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol.\u00a038, pp. 17754\u201317762 (2024)","DOI":"10.1609\/aaai.v38i16.29728"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Crespo\u00a0M\u00e1rquez, A.: The curse of dimensionality. In: Digital Maintenance Management: Guiding Digital Transformation in Maintenance, pp. 67\u201386. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-97660-6_7","DOI":"10.1007\/978-3-030-97660-6_7"},{"key":"1_CR5","unstructured":"Cui, J., Li, Z., Yan, Y., Chen, B., Yuan, L.: ChatLaw: open-source legal large language model with integrated external knowledge bases. arXiv preprint arXiv:2306.16092 (2023)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Cui, N., et al.: Towards multi-user, secure, and verifiable $$ k $$ NN query in cloud database. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3237879"},{"key":"1_CR7","unstructured":"Fu, C., Xiang, C., Wang, C., Cai, D.: Fast approximate nearest neighbor search with the navigating spreading-out graph. arXiv preprint arXiv:1707.00143 (2017)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gong, L., Wang, H., Ogihara, M., Xu, J.: IDEC: indexable distance estimating codes for approximate nearest neighbor search. Proc. VLDB 13(9) (2020)","DOI":"10.14778\/3397230.3397243"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Harwood, B., Drummond, T.: FANNG: fast approximate nearest neighbour graphs. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 5713\u20135722 (2016)","DOI":"10.1109\/CVPR.2016.616"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Huang, Q., Feng, J., Fang, Q.: Reverse query-aware locality-sensitive hashing for high-dimensional furthest neighbor search. In: IEEE ICDE, pp. 167\u2013170 (2017)","DOI":"10.1109\/ICDE.2017.66"},{"issue":"5","key":"1_CR11","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00778-017-0472-7","volume":"26","author":"Q Huang","year":"2017","unstructured":"Huang, Q., Feng, J., Fang, Q., Ng, W., Wang, W.: Query-aware locality-sensitive hashing scheme for LP norm. VLDB J. 26(5), 683\u2013708 (2017)","journal-title":"VLDB J."},{"issue":"1","key":"1_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H Jegou","year":"2010","unstructured":"Jegou, H., Douze, M., Schmid, C.: Product quantization for nearest neighbor search. IEEE TPAMI 33(1), 117\u2013128 (2010)","journal-title":"IEEE TPAMI"},{"issue":"6","key":"1_CR13","first-page":"1494","volume":"26","author":"Y Jing","year":"2013","unstructured":"Jing, Y., Hu, L., Ku, W.S., Shahabi, C.: Authentication of k nearest neighbor query on road networks. IEEE TKDE 26(6), 1494\u20131506 (2013)","journal-title":"IEEE TKDE"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Leu, J., Wang, Y., Tomizuka, M., Di\u00a0Cairano, S.: Improved a-search guided tree for autonomous trailer planning. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 7190\u20137196 (2022)","DOI":"10.1109\/IROS47612.2022.9982121"},{"key":"1_CR15","unstructured":"Lewis, P., et al.: Retrieval-augmented generation for knowledge-intensive NLP tasks. In: Advances in Neural Information Processing Systems, vol. 33, pp. 9459\u20139474 (2020)"},{"issue":"12","key":"1_CR16","doi-asserted-by":"publisher","first-page":"3325","DOI":"10.1007\/s10115-022-01742-0","volume":"64","author":"L Li","year":"2022","unstructured":"Li, L., Cai, J., Xu, J.: A learned index for approximate KNN queries in high-dimensional spaces. Knowl. Inf. Syst. 64(12), 3325\u20133342 (2022)","journal-title":"Knowl. Inf. Syst."},{"issue":"8","key":"1_CR17","first-page":"1475","volume":"32","author":"W Li","year":"2019","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data\u2013experiments, analyses, and improvement. IEEE TKDE 32(8), 1475\u20131488 (2019)","journal-title":"IEEE TKDE"},{"key":"1_CR18","series-title":"CCIS","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-981-19-7242-3_12","volume-title":"SocialSec 2022","author":"Z Li","year":"2022","unstructured":"Li, Z., Tian, G., Tan, S.: Secure and efficient K-nearest neighbor query with privacy-preserving authentication. In: Chen, X., Huang, X., Kuty\u0142owski, M. (eds.) SocialSec 2022. CCIS, vol. 1663, pp. 175\u2013198. Springer, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-19-7242-3_12"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Lima, M.W.S., de\u00a0Oliveira, H.A.F., dos Santos, E.M., de\u00a0Moura, E.S., Costa, R.K., Levorato, M.: Efficient and robust WiFi indoor positioning using hierarchical navigable small world graphs. In: the 17th International Symposium on Network Computing and Applications (NCA), pp.\u00a01\u20135. IEEE (2018)","DOI":"10.1109\/NCA.2018.8548076"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Meng, Y., et al.: PMD: an optimal transportation-based user distance for recommender systems. In: 42nd European Conference on IR Research (ECIR), pp. 272\u2013280 (2020)","DOI":"10.1007\/978-3-030-45442-5_34"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Munoz, J.V., Gon\u00e7alves, M.A., Dias, Z., Torres, R.D.S.: Hierarchical clustering-based graphs for large scale approximate nearest neighbor search. Pattern Recogn. 96, 106970 (2019)","DOI":"10.1016\/j.patcog.2019.106970"},{"issue":"5","key":"1_CR22","first-page":"641","volume":"23","author":"S Papadopoulos","year":"2010","unstructured":"Papadopoulos, S., Wang, L., Yang, Y., Papadias, D., Karras, P.: Authenticated multistep nearest neighbor search. IEEE TKDE 23(5), 641\u2013654 (2010)","journal-title":"IEEE TKDE"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/TMM.2008.917339","volume":"10","author":"J Shao","year":"2008","unstructured":"Shao, J., Huang, Z., Shen, H.T., Zhou, X., Lim, E.P., Li, Y.: Batch nearest neighbor search for video retrieval. IEEE Trans. Multimedia 10(3), 409\u2013420 (2008)","journal-title":"IEEE Trans. Multimedia"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Silpa-Anan, C., Hartley, R.: Optimised KD-trees for fast image descriptor matching. In: Proceedings of IEEE CVPR, pp.\u00a01\u20138. IEEE (2008)","DOI":"10.1109\/CVPR.2008.4587638"},{"key":"1_CR25","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107305","volume":"229","author":"X Xu","year":"2021","unstructured":"Xu, X., Wang, M., Wang, Y., Ma, D.: Two-stage routing with optimized guided search and greedy algorithm on proximity graph. Knowl.-Based Syst. 229, 107305 (2021)","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"1_CR26","doi-asserted-by":"publisher","first-page":"136","DOI":"10.3390\/bdcc6040136","volume":"6","author":"S Yuenyong","year":"2022","unstructured":"Yuenyong, S., Wongpatikaseree, K.: Improving natural language person description search from videos with language model fine-tuning and approximate nearest neighbor. Big Data and Cogn. Comput. 6(4), 136 (2022)","journal-title":"Big Data and Cogn. Comput."},{"issue":"2","key":"1_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3086695","volume":"36","author":"J Zhang","year":"2017","unstructured":"Zhang, J., et al.: Fast and flexible top-k similarity search on large networks. ACM Trans. Inf. Syst. (TOIS) 36(2), 1\u201330 (2017)","journal-title":"ACM Trans. Inf. Syst. (TOIS)"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.patcog.2016.08.023","volume":"62","author":"X Zhang","year":"2017","unstructured":"Zhang, X., Li, Y., Kotagiri, R., Wu, L., Tari, Z., Cheriet, M.: KRNN: K rare-class nearest neighbour classification. Pattern Recogn. 62, 33\u201344 (2017)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0821-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:05:48Z","timestamp":1734152748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0821-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,15]]},"ISBN":["9789819608201","9789819608218"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0821-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,15]]},"assertion":[{"value":"15 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"3 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adma2024.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}