{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:21:44Z","timestamp":1740133304557,"version":"3.37.3"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T00:00:00Z","timestamp":1738368000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U23B2004","62302510"],"award-info":[{"award-number":["U23B2004","62302510"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"Major Program\/Open Project of Xiangjiang Laboratory","doi-asserted-by":"publisher","award":["23XJ0100"],"award-info":[{"award-number":["23XJ0100"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw."],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1109\/tnet.2024.3473853","type":"journal-article","created":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T18:03:24Z","timestamp":1730311404000},"page":"78-98","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Indexing: An Efficient Feature-Based Indexing Framework for Similarity Data Sharing at the Network Edge"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2102-1607","authenticated-orcid":false,"given":"Yuchen","family":"Sun","sequence":"first","affiliation":[{"name":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology (NUDT), Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4886-9974","authenticated-orcid":false,"given":"Lailong","family":"Luo","sequence":"additional","affiliation":[{"name":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology (NUDT), Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-5540","authenticated-orcid":false,"given":"Deke","family":"Guo","sequence":"additional","affiliation":[{"name":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2011-2873","authenticated-orcid":false,"given":"Li","family":"Liu","sequence":"additional","affiliation":[{"name":"College of Electronic Science, NUDT, Changsha, Hunan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bangbang","family":"Ren","sequence":"additional","affiliation":[{"name":"Science and Technology on Information Systems Engineering Laboratory, National University of Defense Technology (NUDT), Changsha, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228941"},{"key":"ref2","article-title":"Mobile edge computing\u2014A key technology towards 5G","volume-title":"ETSI, France, White Paper 11","author":"Hu","year":"2015"},{"key":"ref3","article-title":"6G white paper on edge intelligence","author":"Peltonen","year":"2020","journal-title":"arXiv:2004.14850"},{"volume-title":"Rethink Data: Put More of Your Business Data to Work-From Edge to Cloud","year":"2020","key":"ref4"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3110782"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TCC.2021.3076229"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3058401"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503594"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SEC.2016.25"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3507902"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3054775"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00268"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2018.11.009"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357834"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3135842"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1071610.1071612"},{"key":"ref17","first-page":"986","article-title":"Peer-to-peer similarity search in metric spaces","volume-title":"Proc. ACM PVLDB","author":"Doulkeridis"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516446"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12026-8_4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1041680.1041681"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2005.1610546"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09751-0_17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-03047-6"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71050-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187801"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"ref28","first-page":"1","article-title":"Comparing hybrid peer-to-peer systems","volume-title":"Proc. VLDB","author":"Yang"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/964723.383071"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/WIAPP.2003.1210294"},{"key":"ref31","first-page":"1","article-title":"Beehive: O(1) lookup performance for power-law query distributions in peer-to-peer overlays","volume-title":"Proc. NSDI","author":"Ramasubramanian"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2022.3195664"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2962435"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796847"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM41043.2020.9155345"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref37","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","volume-title":"Proc. ACM PVLDB","author":"Lv"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01258-8_13"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476255"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.07.020"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2016.04.008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/tpami.2024.3379571"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-022-10342-x"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14778"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-070220-100858"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1561\/2200000073"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s007780200060"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/B978-012099975-0.50005-1","article-title":"Multidimensional scaling","volume-title":"Measurement, Judgment and Decision Making","author":"Carroll","year":"1998"},{"volume-title":"Sparse multidimensional scaling using landmark points","year":"2004","author":"De Silva","key":"ref51"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/73833.73869"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1112\/S0025579300002850"},{"key":"ref54","article-title":"Deep image retrieval: A survey","volume-title":"arXiv:2101.11282","author":"Chen","year":"2021"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107567"},{"volume-title":"AI Benchmark","year":"2022","author":"Ignatov","key":"ref56"},{"key":"ref57","first-page":"7673","article-title":"On unbalanced optimal transport: An analysis of Sinkhorn algorithm","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Pham"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758770"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.298"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2011.5946540"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"issue":"78","key":"ref62","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."}],"container-title":["IEEE Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10723154\/10891942\/10738466.pdf?arnumber=10738466","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T18:42:06Z","timestamp":1739990526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10738466\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2]]},"references-count":62,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2024.3473853","relation":{},"ISSN":["2998-4157"],"issn-type":[{"type":"electronic","value":"2998-4157"}],"subject":[],"published":{"date-parts":[[2025,2]]}}}