{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:24:58Z","timestamp":1778300698494,"version":"3.51.4"},"reference-count":8,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition Letters"],"published-print":{"date-parts":[[1993,8]]},"DOI":"10.1016\/0167-8655(93)90047-h","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:46:52Z","timestamp":1056995212000},"page":"625-630","source":"Crossref","is-referenced-by-count":7,"title":["A hashing-oriented nearest neighbor searching scheme"],"prefix":"10.1016","volume":"14","author":[{"given":"Chin-Chen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tzong-Chen","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-8655(93)90047-H_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0167-8655(93)90047-H_BIB2","series-title":"Proc. 1985 National Computer Symposium","first-page":"625","article-title":"A fast nearest neighbor search algorithm","author":"Chang","year":"1985"},{"issue":"6","key":"10.1016\/0167-8655(93)90047-H_BIB3","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1109\/TC.1982.1676031","article-title":"On k-nearest neighbor Voronoi diagrams in the plane","volume":"31","author":"Lee","year":"1982","journal-title":"IEEE Trans. Comput."},{"issue":"12","key":"10.1016\/0167-8655(93)90047-H_BIB4","doi-asserted-by":"crossref","first-page":"1072","DOI":"10.1109\/TC.1984.1676388","article-title":"Computational geometry\u2014a survey","volume":"33","author":"Lee","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8655(93)90047-H_BIB5","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0167-8655(93)90047-H_BIB6","article-title":"Computational Geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0167-8655(93)90047-H_BIB7","series-title":"Proc. 16th IEEE Annual Symposium on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"},{"key":"10.1016\/0167-8655(93)90047-H_BIB8","series-title":"Proc. 1978 Internat. Computer Software and Applications Conf.","first-page":"470","article-title":"A nearest neighbor search technique with short zero-in time","author":"Shen","year":"1978"}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390047H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559390047H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:55:07Z","timestamp":1552917307000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559390047H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":8,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["016786559390047H"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(93)90047-h","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}