{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T17:11:58Z","timestamp":1773853918003,"version":"3.50.1"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2003,11,1]],"date-time":"2003-11-01T00:00:00Z","timestamp":1067644800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2003,11]]},"DOI":"10.1109\/tkde.2003.1245286","type":"journal-article","created":{"date-parts":[[2003,11,20]],"date-time":"2003-11-20T23:29:22Z","timestamp":1069370962000},"page":"1472-1486","source":"Crossref","is-referenced-by-count":5,"title":["An efficient technique for nearest-neighbor query processing on the spy-tec"],"prefix":"10.1109","volume":"15","author":[{"family":"Dong-Ho Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Hyoung-Joo Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655799"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/BF00962238"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050057"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/357775.357776"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/218380.218454"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1117\/12.234810"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492202"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/99935.99949"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(00)00009-4"},{"issue":"4","key":"ref11","article-title":"Fast Searching by Content in Multimedia Databases","volume":"18","author":"Faloutsos","year":"1995","journal-title":"Data Eng. Bull."},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/320248.320255"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/348.318586"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/244130.244151"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582321"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01231606"},{"key":"ref18","volume-title":"Trigonometry","author":"Leithold","year":"1989"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253347"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223794"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49257-7_15"},{"key":"ref22","first-page":"194","article-title":"A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces","volume-title":"Proc. 24nd Int\u2019l Conf. Very Large Database","author":"Weber"},{"key":"ref23","first-page":"573","article-title":"An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions","volume-title":"Proc. Fifth ACM-SIAM Symp. Discrete Algorithms","author":"Arya"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293348"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/276304.276318"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253263"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/263661.263671"},{"key":"ref28","first-page":"28","article-title":"The X-Tree: An Indexing Structure for High-Dimensional Data","volume-title":"Proc. 22nd Int\u2019l Conf. Very Large Database","author":"Berchtold"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655779"},{"key":"ref30","first-page":"238","article-title":"Query by Image Example: The CANDID Approach","volume-title":"Proc. SPIE Storage and Retrieval for Image and Video Databases III","volume":"2420","author":"Kelly"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/27902\/01245286.pdf?arnumber=1245286","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,16]],"date-time":"2025-03-16T05:00:17Z","timestamp":1742101217000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1245286\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2003,11]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2003.1245286","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2003,11]]}}}