{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:29:14Z","timestamp":1742797754302},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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 Processing Letters"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0020-0190(98)00193-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:25:26Z","timestamp":1049721926000},"page":"69-76","source":"Crossref","is-referenced-by-count":13,"title":["A model for k-nearest neighbor query processing cost in multidimensional data space"],"prefix":"10.1016","volume":"69","author":[{"given":"Ju-Hong","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guang-Ho","family":"Cha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chin-Wan","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00193-8_BIB1","series-title":"Proc. ACM SIGMOD International Conference on Management of Data","first-page":"322","article-title":"The R\u2217-tree: An efficient and robust access method for points and rectangles","author":"Beckmann","year":"1990"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB2","series-title":"Proc. 21st VLDB Conference","first-page":"299","article-title":"Estimating the selectivity of spatial queries using the \u2018Correlation\u2019 fractal dimension","author":"Belussi","year":"1995"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB3","series-title":"Proc. 15th ACM Symposium on Principles of Database Systems","first-page":"78","article-title":"A cost model for nearest neighbor search in high-dimensional data space","author":"Berchtold","year":"1997"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB4","series-title":"Proc. 22nd International Conference on VLDB","article-title":"The X-tree: An index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB5","series-title":"Proc. 8th International Conference on Database and Expert Systems Application","first-page":"498","article-title":"Analysis of nearest neighbor query performance in multidimensional index structures","author":"Cha","year":"1997"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB6","series-title":"Proc. 13th ACM Symposium on Principles of Database Systems","article-title":"Beyond uniformity and independence: Analysis of R-trees using the concept of fractal dimension","author":"Faloutsos","year":"1995"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB7","series-title":"Proc. ACM SIGMOD International Conference on Management of Data","first-page":"71","article-title":"R-tree: A dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB8","series-title":"Proc. 4th International Symposium on Large Spatial Databases","first-page":"83","article-title":"Ranking in spatial databases","author":"Hjaltason","year":"1995"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB9","series-title":"Proc. 11th ACM Symposium on Principles of Database Systems (PODS)","first-page":"214","article-title":"Towards an analysis of range query performance in spatial data structures","author":"Pagel","year":"1993"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB10","series-title":"Proc. ACM SIGMOD International Conference on Management of Data","first-page":"71","article-title":"Nearest neighbor queries","author":"Roussopoulos","year":"1995"},{"key":"10.1016\/S0020-0190(98)00193-8_BIB11","series-title":"Proc. 14th ACM Symposium on Principles of Database Systems","article-title":"A model for the prediction of R-tree performance","author":"Theodoridis","year":"1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001938?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001938?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T18:28:56Z","timestamp":1556044136000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001938"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0020019098001938"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00193-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}