{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T12:05:30Z","timestamp":1777637130826,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":["Information Systems"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1016\/0306-4379(82)90023-0","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"115-122","source":"Crossref","is-referenced-by-count":14,"title":["Tree structures for high dimensionality nearest neighbor searching"],"prefix":"10.1016","volume":"7","author":[{"given":"C.M.","family":"Eastman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.F.","family":"Weiss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(82)90023-0_BIB1","series-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(82)90023-0_BIB2","series-title":"Dynamic Information and Library Processing","author":"Salton","year":"1975"},{"key":"10.1016\/0306-4379(82)90023-0_BIB3","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multi-dimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(82)90023-0_BIB4","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TSE.1981.230839","article-title":"Extended k-d tree database organization: a dynamic multiattribute clustering method","volume":"SE-7","author":"Chang","year":"1981","journal-title":"IEEE Trans. Software Engng"},{"key":"10.1016\/0306-4379(82)90023-0_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic expected time","volume":"3","author":"Friedman","year":"1977","journal-title":"ACM Trans. Mathematical Software"},{"key":"10.1016\/0306-4379(82)90023-0_BIB6","article-title":"A tree algorithm for nearest neighbor searching in document retrieval systems","author":"Eastman","year":"1977"},{"key":"10.1016\/0306-4379(82)90023-0_BIB7","series-title":"International Conference on Information Storage and Retrieval","first-page":"131","article-title":"A tree algorithm for nearest neighbor searching in document retrieval systems","author":"Eastman","year":"1978"},{"key":"10.1016\/0306-4379(82)90023-0_BIB8","unstructured":"D. E. Willard: k-d trees in a dynamic environment. To appear in Commun. ACM.."},{"key":"10.1016\/0306-4379(82)90023-0_BIB9","unstructured":"E. M. Keen: An analysis of the documentation requrests, in Salton, (20)."},{"key":"10.1016\/0306-4379(82)90023-0_BIB10","series-title":"Information Retrieval Research","article-title":"A probabilistic algorithm for nearest neighbor searching","author":"Weiss","year":"1981"},{"key":"10.1016\/0306-4379(82)90023-0_BIB11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/320289.320291","article-title":"Generation and search of clustered files","volume":"3","author":"Salton","year":"1978","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0306-4379(82)90023-0_BIB12","doi-asserted-by":"crossref","first-page":"750","DOI":"10.1109\/T-C.1975.224297","article-title":"A branch and bound algorithm for computing k-nearest neighbors","volume":"C-24","author":"Fukunaga","year":"1975","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0306-4379(82)90023-0_BIB13","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1145\/361179.361205","article-title":"The best-match problem in document retrieval","volume":"17","author":"Van Rijsbergen","year":"1974","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(82)90023-0_BIB14","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/356789.356797","article-title":"Data structures for range searching","volume":"11","author":"Bentley","year":"1979","journal-title":"Comput. Surveys"},{"key":"10.1016\/0306-4379(82)90023-0_BIB15","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/362003.362025","article-title":"Some approaches to best-match file searching","volume":"16","author":"Burkhard","year":"1973","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(82)90023-0_BIB16","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/362342.362353","article-title":"Design of tree structures for efficient querying","volume":"16","author":"Casey","year":"1979","journal-title":"Commun. ACM"},{"key":"10.1016\/0306-4379(82)90023-0_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","article-title":"Quad trees; a data structure for retrieval on composite keys","volume":"4","author":"Finkel","year":"1974","journal-title":"Acta Informatica"},{"key":"10.1016\/0306-4379(82)90023-0_BIB18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1145\/320613.320618","article-title":"Quintary trees: A file structure for multidimensional database systems","volume":"5","author":"Lee","year":"1980","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0306-4379(82)90023-0_BIB19","series-title":"The Art of Computer Programming, Volume I: Fundamental Algorithms","author":"Knuth","year":"1973"},{"key":"10.1016\/0306-4379(82)90023-0_BIB20","series-title":"The SMART Retrieval System: Experiments in Automatic Document Processing","year":"1971"}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437982900230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437982900230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T04:52:09Z","timestamp":1552625529000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437982900230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0306437982900230"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(82)90023-0","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}