{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T04:30:34Z","timestamp":1769142634835,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819557158","type":"print"},{"value":"9789819557165","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-981-95-5716-5_30","type":"book-chapter","created":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:06:56Z","timestamp":1769087216000},"page":"486-501","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LH-DPT: An Update Efficient Index for\u00a0High-Dimensional Approximate Nearest Neighbor Search"],"prefix":"10.1007","author":[{"given":"Xinrui","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xianping","family":"Meng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Na","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,23]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Karpukhin, V., et al.: Dense passage retrieval for open-domain question answering. arXiv preprint arXiv:2004.04906 (2020)","DOI":"10.18653\/v1\/2020.emnlp-main.550"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Ferhatosmanoglu, H., Tuncel, E., Agrawal, D., El Abbadi, A.: Approximate nearest neighbor searching in multimedia databases. In: Proceedings 17th International Conference on Data Engineering, pp. 503\u2013511. IEEE (2001)","DOI":"10.1109\/ICDE.2001.914864"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1021\/acs.jcim.8b00524","volume":"59","author":"M Awale","year":"2018","unstructured":"Awale, M., Reymond, J.L.: Polypharmacology browser PPB2: target prediction combining nearest neighbors with machine learning. J. Chem. Inf. Model. 59(1), 10\u201317 (2018)","journal-title":"J. Chem. Inf. Model."},{"key":"30_CR4","first-page":"194","volume":"98","author":"R Weber","year":"1998","unstructured":"Weber, R., Schek, H.-J., Blott, S.: A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. VLDB 98, 194\u2013205 (1998)","journal-title":"VLDB"},{"issue":"3","key":"30_CR5","first-page":"3","volume":"47","author":"Z Wang","year":"2023","unstructured":"Wang, Z., Wang, P., Palpanas, T., Wang, W.: Graph- and tree-based indexes for high-dimensional vector similarity search: analyses, comparisons, and future directions. IEEE Data Eng. Bull. 47(3), 3\u201321 (2023)","journal-title":"IEEE Data Eng. Bull."},{"key":"30_CR6","unstructured":"Andoni, A., Indyk, P.: LSH algorithm and implementation (E2LSH) (2016). https:\/\/www.mit.edu\/andoni\/LSH"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"key":"30_CR8","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999: Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518\u2013529 (1999)"},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Gao, J., Jagadish, H.V., Lu, W., Ooi, B.C.: DSH: data sensitive hashing for high-dimensional k-nn search. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1127\u20131138 (2014)","DOI":"10.1145\/2588555.2588565"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp. 604\u2013613 (1998)","DOI":"10.1145\/276698.276876"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Li, W., et al.: Approximate nearest neighbor search on high dimensional data - experiments, analyses, and improvement. IEEE Trans. Knowl. Data Eng. 32(8) (2022)","DOI":"10.1109\/TKDE.2019.2909204"},{"issue":"1","key":"30_CR13","first-page":"1","volume":"9","author":"Q Huang","year":"2015","unstructured":"Huang, Q., Feng, J., Zhang, Y., Fang, Q., Ng, W.: Query-aware locality-sensitive hashing for approximate nearest neighbor search. PVLDB 9(1), 1\u201312 (2015)","journal-title":"PVLDB"},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"Guttman, A.: R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data, pp. 47\u201357 (1984)","DOI":"10.1145\/602259.602266"},{"key":"30_CR15","unstructured":"Ciaccia, P., Patella, M., Zezula, P., et al.: M-tree: an efficient access method for similarity search in metric spaces. In: VLDB, vol. 97, pp. 426\u2013435. Citeseer (1997)"},{"issue":"5","key":"30_CR16","first-page":"461","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. PVLDB 12(5), 461\u2013474 (2019)","journal-title":"PVLDB"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.is.2013.10.006","volume":"45","author":"Y Malkov","year":"2014","unstructured":"Malkov, Y., Ponomarenko, A., Logvinov, A., Krylov, V.: Approximate nearest neighbor algorithm based on navigable small world graphs. Inf. Syst. 45, 61\u201368 (2014)","journal-title":"Inf. Syst."},{"issue":"4","key":"30_CR18","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":"30_CR19","doi-asserted-by":"crossref","unstructured":"Sun, Y., Wang, W., Qin, J., Zhang, Y., Lin, X.: SRS: solving c-approximate nearest neighbor queries in high dimensional Euclidean space with a tiny index. Proc. VLDB Endow. (2014)","DOI":"10.14778\/2735461.2735462"},{"issue":"5","key":"30_CR20","doi-asserted-by":"publisher","first-page":"643","DOI":"10.14778\/3377369.3377374","volume":"13","author":"B Zheng","year":"2020","unstructured":"Zheng, B., Xi, Z., Weng, L., Hung, N.Q.V., Liu, H., Jensen, C.S.: PM-LSH: a fast and accurate LSH framework for high-dimensional approximate NN search. Proc. VLDB Endow. 13(5), 643\u2013655 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Tian, Y., Zhao, X., Zhou, X.: DB-LSH 2.0: locality-sensitive hashing with query-based dynamic bucketing. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3295831"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Kraska, T., Beutel, A., Chi, E.H., Dean, J., Polyzotis, N.: The case for learned index structures. In: Proceedings of the 2018 International Conference on Management of Data, pp. 489\u2013504 (2018)","DOI":"10.1145\/3183713.3196909"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Nathan, V., Ding, J., Alizadeh, M., Kraska, T.: Learning multi-dimensional indexes. In: Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data, pp. 985\u20131000 (2020)","DOI":"10.1145\/3318464.3380579"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Ding, J., Nathan, V., Alizadeh, M., Kraska, T.: Tsunami: a learned multi-dimensional index for correlated data and skewed workloads. arXiv preprint arXiv:2006.13282 (2020)","DOI":"10.14778\/3425879.3425880"},{"issue":"2","key":"30_CR25","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1007\/s00500-023-09402-3","volume":"28","author":"R Liu","year":"2024","unstructured":"Liu, R., Zhao, J., Chu, X., Liang, Y., Zhou, W., He, J.: Can LSH (locality-sensitive hashing) be replaced by neural network? Soft. Comput. 28(2), 1041\u20131053 (2024)","journal-title":"Soft. Comput."}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5716-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T13:07:03Z","timestamp":1769087223000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5716-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819557158","9789819557165"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5716-5_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"23 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenyang","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"28 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb2025.sau.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}