{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,7]],"date-time":"2026-08-07T08:08:30Z","timestamp":1786090110958,"version":"3.56.0"},"reference-count":83,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T00:00:00Z","timestamp":1685059200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"the Hong Kong RGC RIF Project","award":["R6020-19"],"award-info":[{"award-number":["R6020-19"]}]},{"name":"China NSFC","award":["No. 61729201"],"award-info":[{"award-number":["No. 61729201"]}]},{"name":"National Science Foundation of China (NSFC) under Grant","award":["No. U22B2060"],"award-info":[{"award-number":["No. U22B2060"]}]},{"name":"the Hong Kong RGC GRF Project","award":["16209519"],"award-info":[{"award-number":["16209519"]}]},{"name":"Hong Kong ITC ITF grants","award":["MHX\/078\/21 and PRP\/004\/22FX"],"award-info":[{"award-number":["MHX\/078\/21 and PRP\/004\/22FX"]}]},{"name":"the Hong Kong RGC CRF Project","award":["C6030-18G, C2004-21GF"],"award-info":[{"award-number":["C6030-18G, C2004-21GF"]}]},{"name":"HKUST Global Strategic Partnership Fund"},{"name":"the Beihang University Basic Research Funding","award":["No. YWF-22-L-531"],"award-info":[{"award-number":["No. YWF-22-L-531"]}]},{"DOI":"10.13039\/501100021171","name":"Guangdong Basic and Applied Basic Research Foundation","doi-asserted-by":"crossref","award":["2019B151530001"],"award-info":[{"award-number":["2019B151530001"]}],"id":[{"id":"10.13039\/501100021171","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the National Science Foundation of China (NSFC) under Grant","award":["No. U21A20516 and 62076017"],"award-info":[{"award-number":["No. U21A20516 and 62076017"]}]},{"name":"WeBank Scholars Program"},{"name":"National Key Research and Development Program of China Grant","award":["No. 2018AAA0101100"],"award-info":[{"award-number":["No. 2018AAA0101100"]}]},{"name":"the Hong Kong RGC AOE Project","award":["AoE\/E-603\/18"],"award-info":[{"award-number":["AoE\/E-603\/18"]}]},{"name":"icrosoft Research Asia Collaborative Research Grant"},{"name":"HKUST-Webank joint research lab grant"},{"name":"the Hong Kong RGC Theme-based project","award":["TRS T41-603\/20R"],"award-info":[{"award-number":["TRS T41-603\/20R"]}]},{"name":"the Funding","award":["No. 22-TQ23-14-ZD-01-001"],"award-info":[{"award-number":["No. 22-TQ23-14-ZD-01-001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2023,5,26]]},"abstract":"<jats:p>Similarity search is getting increasingly useful in real applications. This paper focuses on the in-memory similarity search, i.e., the range query and k nearest neighbor (kNN) query, under arbitrary metric spaces, where the only known information is the distance function to measure the similarity between two objects. Although lots of research has studied this problem, the query efficiency of existing solutions is still unsatisfactory. To further improve the query efficiency, we are inspired by the tree embeddings, which map each object into a unique leaf of a well-structured tree solely based on the distances. Unlike existing embedding techniques (e.g., Lipschitz embeddings and pivot mapping) for similarity search, where an extra multi-dimensional index is needed to index the embedding space (e.g., Lp metrics), we directly use this tree to answer similarity search. This seems to be promising, but it is challenging to tailor tree embeddings for efficient similarity search. Specifically, we present a novel index called LiteHST, which is based on the most popular tree embedding (HST) and heavily customized for similarity search in the node structure and storage scheme. We propose a new construction algorithm with lower time complexity than existing methods and prove the optimality of LiteHST in the distance bound. Based on this new index, we also design optimization techniques that heavily reduce the number of distance computations and hence save running time. Finally, extensive experiments demonstrate that our solution outperforms the state-of-the-art in the query efficiency by a large margin.<\/jats:p>","DOI":"10.1145\/3588715","type":"journal-article","created":{"date-parts":[[2023,5,30]],"date-time":"2023-05-30T17:42:05Z","timestamp":1685468525000},"page":"1-26","source":"Crossref","is-referenced-by-count":8,"title":["LiteHST: A Tree Embedding based Method for Similarity Search"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0126-3083","authenticated-orcid":false,"given":"Yuxiang","family":"Zeng","sequence":"first","affiliation":[{"name":"Beihang University &amp; The Hong Kong University of Science and Technology, Beijing, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5598-0312","authenticated-orcid":false,"given":"Yongxin","family":"Tong","sequence":"additional","affiliation":[{"name":"Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8257-5806","authenticated-orcid":false,"given":"Lei","family":"Chen","sequence":"additional","affiliation":[{"name":"The Hong Kong University of Science and Technology, Hong Kong SAR, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,5,30]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2021. List of English words. https:\/\/github.com\/dwyl\/english-words\/"},{"key":"e_1_2_2_2_1","unstructured":"2021. Scikit-learn. https:\/\/scikit-learn.org\/stable\/"},{"key":"e_1_2_2_3_1","unstructured":"2022. The in-memory M-tree. https:\/\/github.com\/erdavila\/M-Tree"},{"key":"e_1_2_2_4_1","unstructured":"2022. The SIFT dataset. http:\/\/corpus-texmex.irisa.fr\/"},{"key":"e_1_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Ittai Abraham Yair Bartal and Ofer Neiman. 2006. Advances in metric embedding theory. In STOC. 271--286.","DOI":"10.1145\/1132516.1132557"},{"key":"e_1_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Laurent Amsaleg Oussama Chelly Teddy Furon St\u00e9phane Girard Michael E. Houle Keichi Kawarabayashi and Michael Nett. 2015. Estimating Local Intrinsic Dimensionality. In SIGKDD. 29--38.","DOI":"10.1145\/2783258.2783405"},{"key":"e_1_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Laurent Amsaleg Oussama Chelly Michael E. Houle Ken-ichi Kawarabayashi Milos Radovanovic and Weeris Treeratanajaru. 2019. Intrinsic Dimensionality Estimation within Tight Localities. In SDM. 181--189.","DOI":"10.1137\/1.9781611975673.21"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101774"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3204028.3204034"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"e_1_2_2_11_1","unstructured":"Arturs Backurs Piotr Indyk Krzysztof Onak Baruch Schieber Ali Vakilian and Tal Wagner. 2019. Scalable Fair Clustering. In ICML. 405--413."},{"key":"e_1_2_2_12_1","doi-asserted-by":"crossref","unstructured":"Yair Bartal. 1996. Probabilistic Approximations of Metric Spaces and Its Algorithmic Applications. In FOCS. 184--193.","DOI":"10.1109\/SFCS.1996.548477"},{"key":"e_1_2_2_13_1","doi-asserted-by":"crossref","unstructured":"Yair Bartal. 1998. On Approximating Arbitrary Metrices by Tree Metrics. In STOC. 161--168.","DOI":"10.1145\/276698.276725"},{"key":"e_1_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Guy E. Blelloch Anupam Gupta and Kanat Tangwongsan. 2012. Parallel probabilistic tree embeddings k-median and buy-at-bulk network design. In SPAA. 205--213.","DOI":"10.1145\/2312005.2312045"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02776078"},{"key":"e_1_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Tolga Bozkaya and Z. Meral \u00d6zsoyoglu. 1997. Distance-Based Indexing for High-Dimensional Metric Spaces. In SIGMOD. 357--368.","DOI":"10.1145\/253262.253345"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/328939.328959"},{"key":"e_1_2_2_18_1","unstructured":"Sergey Brin. 1995. Near Neighbor Search in Large Metric Spaces. In VLDB. 574--584."},{"key":"e_1_2_2_19_1","doi-asserted-by":"crossref","unstructured":"Luis Britos A. Marcela Printista and Nora Reyes. 2012. DSACL-tree: A Dynamic Data Structure for Similarity Search in Secondary Memory. In SISAP. 116--131.","DOI":"10.1007\/978-3-642-32153-5_9"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067426"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Edgar Ch\u00e1vez and Gonzalo Navarro. 2000. An Effective Clustering Algorithm to Index High Dimensional Metric Spaces. In SPIRE. 75--86.","DOI":"10.1109\/SPIRE.2000.878182"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_2_2_24_1","unstructured":"Shuchi Chawla Cynthia Dwork Frank McSherry and Kunal Talwar. 2005. On Privacy-Preserving Histograms. In UAI. 120--127."},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2506556"},{"key":"e_1_2_2_26_1","volume-title":"Jensen","author":"Chen Lu","year":"2023","unstructured":"Lu Chen, Yunjun Gao, Xuan Song, Zheng Li, Yifan Zhu, Xiaoye Miao, and Christian S. Jensen. 2023. Indexing Metric Spaces for Exact Similarity Search. ACM Comput. Surv. 55, 6 (2023), 128:1--128:39."},{"key":"e_1_2_2_27_1","volume-title":"M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In PVLDB. 426--435.","author":"Ciaccia Paolo","year":"1997","unstructured":"Paolo Ciaccia, Marco Patella, and Pavel Zezula. 1997. M-tree: An Efficient Access Method for Similarity Search in Metric Spaces. In PVLDB. 426--435."},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Christian Coester and Elias Koutsoupias. 2019. The online k-taxi problem. In STOC. 1136--1147.","DOI":"10.1145\/3313276.3316370"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.46"},{"key":"e_1_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Vlastislav Dohnal. 2004. An Access Structure for Similarity Search in Metric Spaces. In EDBT. 133--143.","DOI":"10.1007\/978-3-540-30192-9_13"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025026030880"},{"key":"e_1_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Karima Echihabi Kostas Zoumpatianos and Themis Palpanas. 2021. High-Dimensional Similarity Search for Scalable Data Science. In ICDE. 2369--2372.","DOI":"10.1109\/ICDE51399.2021.00268"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282498"},{"key":"e_1_2_2_34_1","unstructured":"Yunus Esencayi Marco Gaboardi Shi Li and Di Wang. 2019. Facility Location Problem in Differential Privacy Model Revisited. In NeurIPS. 8489--8498."},{"key":"e_1_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Jittat Fakcharoenphol Satish Rao and Kunal Talwar. 2003. A tight bound on approximating arbitrary metrics by tree metrics. In STOC. 448--455.","DOI":"10.1145\/780542.780608"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/3389133.3389135"},{"key":"e_1_2_2_37_1","unstructured":"Karina Figueroa Gonzalo Navarro and Edgar Chavez. 2017. The Metric Spaces Library maintained by the SISAP initiative. https:\/\/github.com\/kaarinita\/metricSpaces"},{"key":"e_1_2_2_38_1","doi-asserted-by":"crossref","unstructured":"Karina Figueroa and Nora Reyes. 2019. Permutation's Signatures for Proximity Searching in Metric Spaces. In SISAP. 151--159.","DOI":"10.1007\/978-3-030-32047-8_14"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2006.06.012"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3231591"},{"key":"e_1_2_2_41_1","volume-title":"Introduction to statistical pattern recognition","author":"Fukunaga Keinosuke","unstructured":"Keinosuke Fukunaga. 2013. Introduction to statistical pattern recognition. Elsevier."},{"key":"e_1_2_2_42_1","unstructured":"Jie Gao Leonidas J. Guibas Nikola Milosavljevic and Dengpan Zhou. 2009. Distributed resource management and matching in sensor networks. In IPSN. 97--108."},{"key":"e_1_2_2_43_1","unstructured":"Aristides Gionis Piotr Indyk and Rajeev Motwani. 1999. Similarity Search in High Dimensions via Hashing. In VLDB. 518--529."},{"key":"e_1_2_2_44_1","volume-title":"Geometric approximation algorithms","author":"Har-Peled Sariel","unstructured":"Sariel Har-Peled. 2011. Geometric approximation algorithms. American Mathematical Society."},{"key":"e_1_2_2_45_1","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"Hastie Trevor","unstructured":"Trevor Hastie, Jerome H. Friedman, and Robert Tibshirani. 2001. The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958948"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2003.1195989"},{"key":"e_1_2_2_48_1","volume-title":"Density and Distance Distributions. In 2013 IEEE 13th International Conference on Data Mining Workshops. 468--473","author":"Houle Michael E.","year":"2013","unstructured":"Michael E. Houle. 2013. Dimensionality, Discriminability, Density and Distance Distributions. In 2013 IEEE 13th International Conference on Data Mining Workshops. 468--473."},{"key":"e_1_2_2_49_1","doi-asserted-by":"crossref","unstructured":"Michael E. Houle. 2017. Local Intrinsic Dimensionality I: An Extreme-Value-Theoretic Foundation for Similarity Applications. In SISAP. 64--79.","DOI":"10.1007\/978-3-319-68474-1_5"},{"key":"e_1_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Michael E. Houle. 2017. Local Intrinsic Dimensionality II: Multivariate Analysis and Distributional Support. In SISAP. 80--95.","DOI":"10.1007\/978-3-319-68474-1_6"},{"key":"e_1_2_2_51_1","doi-asserted-by":"crossref","unstructured":"Michael E. Houle. 2020. Local Intrinsic Dimensionality III: Density and Similarity. In SISAP. 248--260.","DOI":"10.1007\/978-3-030-60936-8_19"},{"key":"e_1_2_2_52_1","volume-title":"Wali","author":"Houle Michael E.","year":"2018","unstructured":"Michael E. Houle, Vincent Oria, Kurt R. Rohloff, and Arwa M. Wali. 2018. LID-Fingerprint: A Local Intrinsic Dimensionality-Based Fingerprinting Method. In SISAP. 134--147."},{"key":"e_1_2_2_53_1","volume-title":"Wali","author":"Houle Michael E.","year":"2017","unstructured":"Michael E. Houle, Vincent Oria, and Arwa M. Wali. 2017. Improving k-NN Graph Accuracy Using Local Intrinsic Dimensionality. In SISAP. 110--124."},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0472-7"},{"key":"e_1_2_2_56_1","doi-asserted-by":"crossref","unstructured":"Piotr Indyk. 2001. Algorithmic Applications of Low-Distortion Geometric Embeddings. In FOCS. 10--33.","DOI":"10.1109\/SFCS.2001.959878"},{"key":"e_1_2_2_57_1","volume-title":"Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics 26","author":"Johnson William B","year":"1984","unstructured":"William B Johnson and Joram Lindenstrauss. 1984. Extensions of Lipschitz mappings into a Hilbert space. Contemporary mathematics 26 (1984), 189--206."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-005-0178-0"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.235263"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00161-2"},{"key":"e_1_2_2_61_1","volume-title":"Jeffrey Dean, and Neoklis Polyzotis.","author":"Kraska Tim","year":"2018","unstructured":"Tim Kraska, Alex Beutel, Ed H. Chi, Jeffrey Dean, and Neoklis Polyzotis. 2018. The Case for Learned Index Structures. In SIGMOD. 489--504."},{"key":"e_1_2_2_62_1","doi-asserted-by":"crossref","unstructured":"Nathan Linial Eran London and Yuri Rabinovich. 1994. The geometry of graphs and some of its algorithmic applications. In FOCS. 577--591.","DOI":"10.1109\/SFCS.1994.365733"},{"key":"e_1_2_2_63_1","volume-title":"Lectures on discrete geometry. Graduate texts in mathematics","author":"Matousek Jir\u00ed","unstructured":"Jir\u00ed Matousek. 2002. Lectures on discrete geometry. Graduate texts in mathematics, Vol. 212. Springer."},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.10.002"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407829"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397506"},{"key":"e_1_2_2_68_1","first-page":"3437","article-title":"Similarity Query Processing for High-Dimensional Data","volume":"13","author":"Qin Jianbin","year":"2020","unstructured":"Jianbin Qin, Wei Wang, Chuan Xiao, and Ying Zhang. 2020. Similarity Query Processing for High-Dimensional Data. PVDLB 13, 12 (2020), 3437--3440.","journal-title":"PVDLB"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-017-9966-y"},{"key":"e_1_2_2_70_1","volume-title":"Digital signal processing","author":"Roberts Richard A","unstructured":"Richard A Roberts and Clifford T Mullis. 1987. Digital signal processing. Addison-Wesley Longman Publishing Co., Inc."},{"key":"e_1_2_2_71_1","volume-title":"Foundations of multidimensional and metric data structures","author":"Samet Hanan","unstructured":"Hanan Samet. 2006. Foundations of multidimensional and metric data structures. Academic Press."},{"key":"e_1_2_2_72_1","doi-asserted-by":"crossref","unstructured":"Tom\u00e1s Skopal Jaroslav Pokorn\u00fd and V\u00e1clav Sn\u00e1sel. 2004. PM-tree: Pivoting Metric Tree for Similarity Search in Multimedia Databases. In ADBIS. 803--815.","DOI":"10.1007\/11408079_73"},{"key":"e_1_2_2_73_1","doi-asserted-by":"crossref","unstructured":"Qian Tao Yongxin Tong Zimu Zhou Yexuan Shi Lei Chen and Ke Xu. 2020. Differentially Private Online Task Assignment in Spatial Crowdsourcing: A Tree-based Approach. In ICDE. 517--528.","DOI":"10.1109\/ICDE48307.2020.00051"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/2994509.2994523"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00568-7"},{"key":"e_1_2_2_76_1","volume-title":"Handbook of discrete and computational geometry","author":"Toth Csaba D","unstructured":"Csaba D Toth, Joseph O'Rourke, and Jacob E Goodman. 2017. Handbook of discrete and computational geometry. Chapman and Hall\/CRC."},{"key":"e_1_2_2_77_1","doi-asserted-by":"crossref","unstructured":"Lucia Vadicamo Richard Connor Fabrizio Falchi Claudio Gennaro and Fausto Rabitti. 2019. SPLX-Perm: A Novel Permutation-Based Representation for Approximate Metric Search. In SISAP. 40--48.","DOI":"10.1007\/978-3-030-32047-8_4"},{"key":"e_1_2_2_78_1","volume-title":"The design of approximation algorithms","author":"Williamson David P","unstructured":"David P Williamson and David B Shmoys. 2011. The design of approximation algorithms. Cambridge university press."},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368297"},{"key":"e_1_2_2_80_1","volume-title":"HST: An Efficient Index for Embedding Arbitrary Metric Spaces. In ICDE. 648--659.","author":"Zeng Yuxiang","year":"2021","unstructured":"Yuxiang Zeng, Yongxin Tong, and Lei Chen. 2021. HST: An Efficient Index for Embedding Arbitrary Metric Spaces. In ICDE. 648--659."},{"key":"e_1_2_2_81_1","doi-asserted-by":"crossref","unstructured":"Yuxiang Zeng Yongxin Tong and Lei Chen. 2022. Faster and Better Solution to Embed Lp Metrics by Tree Metrics. In SIGMOD. 2135--2148.","DOI":"10.1145\/3514221.3517831"},{"key":"e_1_2_2_82_1","volume-title":"Similarity Search - The Metric Space Approach. Advances in Database Systems","author":"Zezula Pavel","unstructured":"Pavel Zezula, Giuseppe Amato, Vlastislav Dohnal, and Michal Batko. 2006. Similarity Search - The Metric Space Approach. Advances in Database Systems, Vol. 32. Kluwer."},{"key":"e_1_2_2_83_1","volume-title":"Hang Liu, and Christian S. Jensen.","author":"Zheng Bolong","year":"2021","unstructured":"Bolong Zheng, Xi Zhao, Lianggui Weng, Quoc Viet Hung Nguyen, Hang Liu, and Christian S. Jensen. 2021. PM-LSH: a fast and accurate in-memory framework for high-dimensional approximate NN and closest pair search. VLDB J. (2021), 1--25."},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-021-00691-4"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588715","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3588715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:35Z","timestamp":1750178855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3588715"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,26]]},"references-count":83,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,5,26]]}},"alternative-id":["10.1145\/3588715"],"URL":"https:\/\/doi.org\/10.1145\/3588715","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,26]]}}}