{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:48:16Z","timestamp":1760708896850,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2015CB352502"],"award-info":[{"award-number":["2015CB352502"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"publisher","award":["61379033","61472348"],"award-info":[{"award-number":["61379033","61472348"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Central University","award":["2015XZZX005-07"],"award-info":[{"award-number":["2015XZZX005-07"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2016,1,1]]},"DOI":"10.1109\/tkde.2015.2453954","type":"journal-article","created":{"date-parts":[[2015,8,21]],"date-time":"2015-08-21T14:55:43Z","timestamp":1440168943000},"page":"98-112","source":"Crossref","is-referenced-by-count":13,"title":["Metric All-<i>k<\/i>-Nearest-Neighbor Search"],"prefix":"10.1109","volume":"28","author":[{"given":"Lu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Gang","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Haida","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/s10707-009-0076-5"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.infsof.2006.05.006","article-title":"Efficient index-based kNN join processing for high-dimensional data","volume":"49","author":"yu","year":"2007","journal-title":"Inf Softw Technol"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/978-3-642-28148-8_2"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/TKDE.2006.148"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.14778\/2367502.2367538"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.14778\/2732977.2732981"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/ICDE.2010.5447837"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1016\/B978-012088469-8.50067-X"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1109\/TPDS.2005.33"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1145\/2487575.2487625"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1109\/ICDM.2014.20"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1145\/2247596.2247602"},{"key":"ref11","first-page":"426","article-title":"M-tree: An efficient access method for similarity search in metric spaces","author":"ciaccia","year":"0","journal-title":"Proc 23rd Int Conf Very Large Data Bases"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/PL00009449"},{"key":"ref13","first-page":"501","article-title":"Optimizing all-nearest-neighbor queries with trigonometric pruning","author":"emrich","year":"0","journal-title":"Proc 22nd Int Conf Sci Statistical Database Manag"},{"year":"2000","author":"figueroa","article-title":"An efficient algorithm to all k nearest neighbor problem in metric spaces","key":"ref14"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1145\/1516360.1516479"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/s00778-015-0383-4"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/958942.958948"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/1366102.1366104"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/331499.331504"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1007\/978-3-319-11988-5_10"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1007\/s10115-003-0122-9"},{"doi-asserted-by":"publisher","key":"ref27","DOI":"10.1007\/3-540-47724-1_23"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1007\/978-3-540-76993-4_18"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1016\/j.eswa.2010.12.077"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1016\/j.cag.2006.11.011"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/502807.502808"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/ICDE.2015.7113317"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TKDE.2008.146"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/375663.375668"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1109\/ICDE.2007.368964"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/1142473.1142531"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/375663.375718"},{"key":"ref22","first-page":"300","article-title":"(Very) fast (All) k -nearest neighbors in metric and non metric spaces without indexing","author":"miranda","year":"0","journal-title":"Proc 6th Int Conf Similarity Search Appl"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.14778\/2336664.2336674"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1016\/j.is.2010.10.002"},{"key":"ref41","first-page":"297","article-title":"All-nearest-neighbors queries in spatial databases","author":"zhang","year":"0","journal-title":"Proc 16th Int Conf Sci Statist Database Manage"},{"key":"ref23","first-page":"331","article-title":"C2P: clustering based on closest pairs","author":"nanopoulos","year":"0","journal-title":"Proc 27th Int Conf Very Large Data Bases"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1016\/j.jda.2008.09.012"},{"key":"ref25","first-page":"85","article-title":"Practical construction of k -nearest neighbor graphs in metric spaces","author":"paredes","year":"0","journal-title":"Proc 5th Int Conf Exp Algorithms"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/7347496\/07217805.pdf?arnumber=7217805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:46:04Z","timestamp":1641987964000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7217805\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,1]]},"references-count":41,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2015.2453954","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":[[2016,1,1]]}}}