{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T18:56:12Z","timestamp":1772909772950,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T00:00:00Z","timestamp":1625270400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T00:00:00Z","timestamp":1625270400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61902134"],"award-info":[{"award-number":["61902134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62011530437"],"award-info":[{"award-number":["62011530437"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003819","name":"Natural Science Foundation of Hubei Province","doi-asserted-by":"publisher","award":["2020CFB871"],"award-info":[{"award-number":["2020CFB871"]}],"id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["HUST: 2019kfyXJJS091"],"award-info":[{"award-number":["HUST: 2019kfyXJJS091"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["HUST: 2019kfyXKJC021"],"award-info":[{"award-number":["HUST: 2019kfyXKJC021"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00778-021-00680-7","type":"journal-article","created":{"date-parts":[[2021,7,3]],"date-time":"2021-07-03T04:09:05Z","timestamp":1625285345000},"page":"1339-1363","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search"],"prefix":"10.1007","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8639-4570","authenticated-orcid":false,"given":"Bolong","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Xi","family":"Zhao","sequence":"additional","affiliation":[]},{"given":"Lianggui","family":"Weng","sequence":"additional","affiliation":[]},{"given":"Quoc Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Hang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Christian S.","family":"Jensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,3]]},"reference":[{"issue":"2","key":"680_CR1","doi-asserted-by":"publisher","first-page":"1229","DOI":"10.1007\/s11192-017-2569-6","volume":"116","author":"MA Abdulhayoglu","year":"2018","unstructured":"Abdulhayoglu, M.A., Thijs, B.: Use of locality sensitive hashing (LSH) algorithm to match web of science and scopus. Scientometrics 116(2), 1229\u20131245 (2018)","journal-title":"Scientometrics"},{"key":"680_CR2","doi-asserted-by":"crossref","unstructured":"Amsaleg, L., Chelly, O., Furon, T., Girard, S., Houle, M.E., Kawarabayashi, K., Nett, M.: Estimating local intrinsic dimensionality. In: KDD, pp. 29\u201338 (2015)","DOI":"10.1145\/2783258.2783405"},{"key":"680_CR3","unstructured":"Andoni, A., Indyk, P.: LSH algorithm and implementation (E2LSH) (2016)"},{"issue":"3","key":"680_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.datak.2004.08.003","volume":"53","author":"F Angiulli","year":"2005","unstructured":"Angiulli, F., Pizzuti, C.: An approximate algorithm for top-k closest pairs join query in large high dimensional data. Data Knowl. Eng. 53(3), 263\u2013281 (2005)","journal-title":"Data Knowl. Eng."},{"key":"680_CR5","doi-asserted-by":"crossref","unstructured":"Bawa, M., Condie, T., Ganesan, P.: LSH forest: self-tuning indexes for similarity search. In: WWW, pp. 651\u2013660 (2005)","DOI":"10.1145\/1060745.1060840"},{"key":"680_CR6","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.. Schneider, R., Seeger, B.: The R*-tree: an efficient and robust access method for points and rectangles. In: SIGMOD, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"key":"680_CR7","doi-asserted-by":"crossref","unstructured":"Cai, X., Rajasekaran, S., Zhang, F.: Efficient approximate algorithms for the closest pair problem in high dimensional spaces. In: PAKDD (3), volume 10939 of Lecture Notes in Computer Science, pp. 151\u2013163 (2018)","DOI":"10.1007\/978-3-319-93040-4_13"},{"key":"680_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Gao, Y., Li, X., Jensen, C.S., Chen, G.: Efficient metric indexing for similarity search. In: ICDE, pp. 591\u2013602 (2015)","DOI":"10.1109\/ICDE.2015.7113317"},{"key":"680_CR9","unstructured":"Ciaccia, P., Patella, M., Rabitti, F., Zezula, P.: Indexing metric spaces with m-tree. In: SEBD, pp. 67\u201386 (1997)"},{"key":"680_CR10","doi-asserted-by":"crossref","unstructured":"Ciaccia, P., Patella, M., Zezula, P.: A cost model for similarity queries in metric spaces. In: PODS, pp. 59\u201368 (1998)","DOI":"10.1145\/275487.275495"},{"key":"680_CR11","doi-asserted-by":"crossref","unstructured":"Corral, A., D\u2019Ermiliis, A., Manolopoulos, Y., Vassilakopoulos, M.: VA-files versus R*-trees in distance join queries. In: ADBIS, volume 3631 of Lecture Notes in Computer Science, pp. 153\u2013166 (2005)","DOI":"10.1007\/11547686_12"},{"key":"680_CR12","doi-asserted-by":"crossref","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Closest pair queries in spatial databases. In: SIGMOD, pp. 189\u2013200 (2000)","DOI":"10.1145\/335191.335414"},{"issue":"1","key":"680_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.datak.2003.08.007","volume":"49","author":"A Corral","year":"2004","unstructured":"Corral, A., Manolopoulos, Y., Theodoridis, Y., Vassilakopoulos, M.: Algorithms for processing k-closest-pair queries in spatial databases. Data Knowl. Eng. 49(1), 67\u2013104 (2004)","journal-title":"Data Knowl. Eng."},{"key":"680_CR14","doi-asserted-by":"crossref","unstructured":"Das, A., Datar, M., Garg, A., Rajaram, S.: Google news personalization: scalable online collaborative filtering. In: WWW, pp. 271\u2013280 (2007)","DOI":"10.1145\/1242572.1242610"},{"key":"680_CR15","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Symposium on Computational Geometry, pp. 253\u2013262 (2004)","DOI":"10.1145\/997817.997857"},{"key":"680_CR16","doi-asserted-by":"crossref","unstructured":"Dong, W., Wang, Z., Josephson, W., Charikar, M., Li, K.: Modeling LSH for performance tuning. In: CIKM, pp. 669\u2013678 (2008)","DOI":"10.1145\/1458082.1458172"},{"key":"680_CR17","doi-asserted-by":"crossref","unstructured":"Fredriksson, K., Braithwaite, B.: Quicker similarity joins in metric spaces. In: SISAP, volume 8199 of Lecture Notes in Computer Science, pp. 127\u2013140 (2013)","DOI":"10.1007\/978-3-642-41062-8_13"},{"key":"680_CR18","doi-asserted-by":"crossref","unstructured":"Gan, J., Feng, J., Fang, Q., Ng, W.: Locality-sensitive hashing scheme based on dynamic collision counting. In: SIGMOD, pp. 541\u2013552 (2012)","DOI":"10.1145\/2213836.2213898"},{"issue":"3","key":"680_CR19","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00778-015-0383-4","volume":"24","author":"Y Gao","year":"2015","unstructured":"Gao, Y., Chen, L., Li, X., Yao, B., Chen, G.: Efficient k-closest pair queries in general metric spaces. VLDB J. 24(3), 415\u2013439 (2015)","journal-title":"VLDB J."},{"key":"680_CR20","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB, pp. 518\u2013529 (1999)"},{"issue":"12","key":"680_CR21","doi-asserted-by":"publisher","first-page":"2916","DOI":"10.1109\/TPAMI.2012.193","volume":"35","author":"Y Gong","year":"2013","unstructured":"Gong, Y., Lazebnik, S., Gordo, A., Perronnin, F.: Iterative quantization: a procrustean approach to learning binary codes for large-scale image retrieval. TPAMI 35(12), 2916\u20132929 (2013)","journal-title":"TPAMI"},{"issue":"4","key":"680_CR22","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s10707-012-0169-4","volume":"17","author":"G Gutierrez","year":"2013","unstructured":"Gutierrez, G., S\u00e1ez, P.: The k closest pairs in spatial databases\u2014when only one set is indexed. GeoInformatica 17(4), 543\u2013565 (2013)","journal-title":"GeoInformatica"},{"key":"680_CR23","doi-asserted-by":"crossref","unstructured":"Haghani, P., Michel, S., Aberer, K.: Distributed similarity search in high dimensions using locality sensitive hashing. In: EDBT, pp. 744\u2013755 (2009)","DOI":"10.1145\/1516360.1516446"},{"key":"680_CR24","doi-asserted-by":"crossref","unstructured":"Harris, J., St\u00f6cker, H.: Handbook of Mathematics and Computational Science (1998)","DOI":"10.1007\/978-1-4612-5317-4"},{"key":"680_CR25","unstructured":"He, J., Kumar, S., Chang, S.: On the difficulty of nearest neighbor search. In: ICML (2012)"},{"key":"680_CR26","doi-asserted-by":"crossref","unstructured":"Hjaltason, G.R., Samet, H.: Incremental distance join algorithms for spatial databases. In: SIGMOD, pp. 237\u2013248 (1998)","DOI":"10.1145\/276305.276326"},{"issue":"1","key":"680_CR27","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":"680_CR28","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"},{"issue":"7","key":"680_CR29","first-page":"1014","volume":"22","author":"YJ Kim","year":"2010","unstructured":"Kim, Y.J., Patel, J.M.: Performance comparison of the R$${}^{*}$$-tree and the quadtree for knn and distance join queries. TKDE 22(7), 1014\u20131027 (2010)","journal-title":"TKDE"},{"key":"680_CR30","doi-asserted-by":"crossref","unstructured":"Kulis, B., Grauman, K.: Kernelized locality-sensitive hashing for scalable image search. In: ICCV, pp. 2130\u20132137 (2009)","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"680_CR31","doi-asserted-by":"crossref","unstructured":"Kurasawa, H., Takasu, A., Adachi, J.: Finding the k-closest pairs in metric spaces. In: NTSS, pp. 8\u201313 (2011)","DOI":"10.1145\/1966865.1966870"},{"issue":"3","key":"680_CR32","first-page":"423","volume":"31","author":"H Li","year":"2019","unstructured":"Li, H., Nutanong, S., Xu, H., Yu, C., Ha, F.: C2net: a network-efficient approach to collision counting LSH similarity join. TKDE 31(3), 423\u2013436 (2019)","journal-title":"TKDE"},{"key":"680_CR33","doi-asserted-by":"crossref","unstructured":"Li, J., Yan, X., Zhang, J., Xu, A., Cheng, J., Liu, J., Ng, K. K. W., Cheng, T.: A general and efficient querying method for learning to hash. In: SIGMOD, pp. 1333\u20131347 (2018)","DOI":"10.1145\/3183713.3183750"},{"issue":"8","key":"680_CR34","first-page":"1475","volume":"32","author":"W Li","year":"2020","unstructured":"Li, W., Zhang, Y., Sun, Y., Wang, W., Li, M., Zhang, W., Lin, X.: Approximate nearest neighbor search on high dimensional data\u2014experiments, analyses, and improvement. TKDE 32(8), 1475\u20131488 (2020)","journal-title":"TKDE"},{"key":"680_CR35","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB, pp. 950\u2013961 (2007)"},{"issue":"12","key":"680_CR36","first-page":"2021","volume":"10","author":"Q Lv","year":"2017","unstructured":"Lv, Q., Josephson, W., Wang, Z., Charikar, M., Li, K.: Intelligent probing for locality sensitive hashing: multi-probe LSH and beyond. PVLDB 10(12), 2021\u20132024 (2017)","journal-title":"PVLDB"},{"key":"680_CR37","doi-asserted-by":"crossref","unstructured":"Mueen, A., Keogh, E. J., Zhu, Q., Cash, S., Westover, M. B.: Exact discovery of time series motifs. In: SDM, pp. 473\u2013484 (2009)","DOI":"10.1137\/1.9781611972795.41"},{"key":"680_CR38","doi-asserted-by":"crossref","unstructured":"Narang, A., Bhattacherjee, S.: Real-time approximate range motif discovery and data redundancy removal algorithm. In: EDBT, pp. 485\u2013496 (2011)","DOI":"10.1145\/1951365.1951422"},{"key":"680_CR39","doi-asserted-by":"crossref","unstructured":"Panigrahy, R.: Entropy based nearest neighbor search in high dimensions. In: SODA, pp. 1186\u20131195 (2006)","DOI":"10.1145\/1109557.1109688"},{"issue":"1","key":"680_CR40","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jda.2008.09.012","volume":"7","author":"R Paredes","year":"2009","unstructured":"Paredes, R., Reyes, N.: Solving similarity joins and range queries in metric spaces with the list of twin clusters. J. Discrete Algorithms 7(1), 18\u201335 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"680_CR41","doi-asserted-by":"crossref","unstructured":"Pearson, S.S., Silva, Y.N.: Index-based R-S similarity joins. In: SISAP, volume 8821 of Lecture Notes in Computer Science, pp. 106\u2013112 (2014)","DOI":"10.1007\/978-3-319-11988-5_10"},{"issue":"3","key":"680_CR42","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s10044-018-0753-9","volume":"22","author":"M Pirbonyeh","year":"2019","unstructured":"Pirbonyeh, M., Rezaie, V., Parvin, H., Nejatian, S., Mehrabi, M.: A linear unsupervised transfer learning by preservation of cluster-and-neighborhood data organization. Pattern Anal. Appl. 22(3), 1149\u20131160 (2019)","journal-title":"Pattern Anal. Appl."},{"issue":"5","key":"680_CR43","first-page":"430","volume":"5","author":"V Satuluri","year":"2012","unstructured":"Satuluri, V., Parthasarathy, S.: Bayesian locality sensitive hashing for fast similarity search. PVLDB 5(5), 430\u2013441 (2012)","journal-title":"PVLDB"},{"key":"680_CR44","doi-asserted-by":"crossref","unstructured":"Shan, J., Zhang, D., Salzberg, B.: On spatial-range closest-pair query. In: SSTD, volume 2750 of Lecture Notes in Computer Science, pp. 252\u2013269 (2003)","DOI":"10.1007\/978-3-540-45072-6_15"},{"issue":"6","key":"680_CR45","first-page":"1561","volume":"15","author":"H Shin","year":"2003","unstructured":"Shin, H., Moon, B., Lee, S.: Adaptive and incremental processing for distance join queries. TKDE 15(6), 1561\u20131578 (2003)","journal-title":"TKDE"},{"key":"680_CR46","doi-asserted-by":"crossref","unstructured":"Skopal, T., Pokorn\u00fd, J., Sn\u00e1sel, V.: Nearest neighbours search using the PM-tree. In: DASFAA, pp. 803\u2013815 (2005)","DOI":"10.1007\/11408079_73"},{"issue":"1","key":"680_CR47","first-page":"1","volume":"8","author":"Y Sun","year":"2014","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. PVLDB 8(1), 1\u201312 (2014)","journal-title":"PVLDB"},{"key":"680_CR48","doi-asserted-by":"crossref","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Quality and efficiency in high dimensional nearest neighbor search. In: SIGMOD, pp. 563\u2013576 (2009)","DOI":"10.1145\/1559845.1559905"},{"issue":"3","key":"680_CR49","doi-asserted-by":"publisher","first-page":"20:1","DOI":"10.1145\/1806907.1806912","volume":"35","author":"Y Tao","year":"2010","unstructured":"Tao, Y., Yi, K., Sheng, C., Kalnis, P.: Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans. Database Syst. 35(3), 20:1\u201320:46 (2010)","journal-title":"ACM Trans. Database Syst."},{"issue":"4","key":"680_CR50","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TPAMI.2017.2699960","volume":"40","author":"J Wang","year":"2018","unstructured":"Wang, J., Zhang, T., Song, J., Sebe, N., Shen, H.T.: A survey on learning to hash. TPAMI 40(4), 769\u2013790 (2018)","journal-title":"TPAMI"},{"key":"680_CR51","doi-asserted-by":"crossref","unstructured":"Wang, Y., Metwally, A., Parthasarathy, S.: Scalable all-pairs similarity search in metric spaces. In: KDD, pp. 829\u2013837 (2013)","DOI":"10.1145\/2487575.2487625"},{"issue":"4","key":"680_CR52","first-page":"712","volume":"29","author":"C Yu","year":"2017","unstructured":"Yu, C., Nutanong, S., Li, H., Wang, C., Yuan, X.: A generic method for accelerating lsh-based similarity join processing. TKDE 29(4), 712\u2013726 (2017)","journal-title":"TKDE"},{"key":"680_CR53","doi-asserted-by":"crossref","unstructured":"Zheng, B., Zhao, X.,. Weng, L., Hung, N. Q. V., Liu, H., Jensen. C. S.: PM-LSH: A fast and accurate LSH framework for highdimensional approximate NN search. PVLDB 13(5):643\u2013655 (2020)","DOI":"10.14778\/3377369.3377374"},{"key":"680_CR54","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Guo, Q., Tung, A.K.H., Wu, S.: Lazylsh: approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp. 2023\u20132037 (2016)","DOI":"10.1145\/2882903.2882930"},{"issue":"6","key":"680_CR55","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/THMS.2017.2725341","volume":"48","author":"X Zhou","year":"2018","unstructured":"Zhou, X., Wu, B., Jin, Q.: Analysis of user network and correlation for community discovery based on topic-aware similarity and behavioral influence. IEEE Trans. Hum. Mach. Syst. 48(6), 559\u2013571 (2018)","journal-title":"IEEE Trans. Hum. Mach. Syst."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00680-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-021-00680-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-021-00680-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,21]],"date-time":"2022-10-21T07:24:20Z","timestamp":1666337060000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-021-00680-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,3]]},"references-count":55,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["680"],"URL":"https:\/\/doi.org\/10.1007\/s00778-021-00680-7","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,3]]},"assertion":[{"value":"14 December 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 June 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 July 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}