{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T08:03:41Z","timestamp":1764403421039,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tkde.2024.3487759","type":"journal-article","created":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:35:14Z","timestamp":1730223314000},"page":"210-225","source":"Crossref","is-referenced-by-count":3,"title":["DIMS: Distributed Index for Similarity Search in Metric Spaces"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4555-6232","authenticated-orcid":false,"given":"Yifan","family":"Zhu","sequence":"first","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Chengyang","family":"Luo","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"given":"Tang","family":"Qian","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5685-7017","authenticated-orcid":false,"given":"Lu","family":"Chen","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3816-8450","authenticated-orcid":false,"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"College of Computer Science, Zhejiang University, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9792-9171","authenticated-orcid":false,"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.114006"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-2678-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00579-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548221"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3531839"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539375"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/3579075.3579087"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-017-0480-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517831"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.11.014"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.10.014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1983.235263"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90074-R"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.5555\/645923.671005"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)90095-7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/328939.328959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2506556"},{"key":"ref18","first-page":"574","article-title":"Near neighbor search in large metric spaces","volume-title":"Proc. Int. Conf. Very Large Data Bases","author":"Brin"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2010.10.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-016-0024-y"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183743"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137655"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2880215"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00067"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-020-00819-6"},{"issue":"1","key":"ref28","first-page":"59","article-title":"A new technique for verifying the consistency of distributed r-trees","volume":"6","author":"de Oliveira","year":"2015","journal-title":"J. Inf. Data Manag."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32281-5_22"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-019-0095-7"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-022-00181-9"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3534963"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/SPIRE.2000.878182"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253345"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113317"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/11549819_3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10619-009-7047-6"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.14778\/3137765.3137810"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/BigData47090.2019.9006219"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2011.10.004"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-023-3344-x"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882918"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282497"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1177\/1550147718811827"},{"article-title":"Results of the NeurIPS\u201921 challenge on billion-scale approximate nearest neighbor search","year":"2022","author":"Simhadri","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2019.2909204"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3314038"},{"key":"ref55","first-page":"15","article-title":"Bulk loading the m-tree","volume-title":"Proc. 9th Australas. Database Conf.","author":"Ciaccia"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10786487\/10737368.pdf?arnumber=10737368","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,11]],"date-time":"2024-12-11T22:05:19Z","timestamp":1733954719000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10737368\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":51,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3487759","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}