{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T01:38:17Z","timestamp":1649036297816},"reference-count":24,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"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":["Data & Knowledge Engineering"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0169-023x(02)00023-x","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:12:20Z","timestamp":1034593940000},"page":"1-21","source":"Crossref","is-referenced-by-count":18,"title":["A retrieval technique for high-dimensional data and partially specified queries"],"prefix":"10.1016","volume":"42","author":[{"given":"Ratko","family":"Orlandic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Byunggu","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0169-023X(02)00023-X_BIB1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF00289146","article-title":"Expected behavior of B+-trees under random insertions","volume":"26","author":"Baeza-Yates","year":"1989","journal-title":"Acta Informatica"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB2","series-title":"Proceedings 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\/S0169-023X(02)00023-X_BIB3","series-title":"Proceedings 16th International Conference on Data Engineering","first-page":"577","article-title":"Independent quantization: an index compression technique for high-dimensional data","author":"Berchtold","year":"2000"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB4","series-title":"Proceedings ACM SIGMOD International Conference on Management of Data","first-page":"142","article-title":"The Pyramid-Technique: towards breaking the curse of dimensionality","author":"Berchtold","year":"1998"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB5","series-title":"Proceedings 22nd International Conference on Very Large Data Bases","first-page":"28","article-title":"The X-tree: an index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB6","series-title":"Proceedings 7th International Conference on Database Theory","first-page":"217","article-title":"When is `nearest neighbor' meaningful?","author":"Beyer","year":"1999"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/360762.360766","article-title":"Analysis and performance of inverted database structures","volume":"18","author":"Cardenas","year":"1975","journal-title":"Communications of the ACM"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","article-title":"The ubiquitous B-tree","volume":"11","author":"Comer","year":"1979","journal-title":"Computing Surveys"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB9","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/280277.280279","article-title":"Multidimensional access methods","volume":"30","author":"Gaede","year":"1998","journal-title":"ACM Computing Surveys"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB10","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0169-023X(99)00031-2","article-title":"Efficient indexing of high-dimensional data through dimensionality reduction","volume":"32","author":"Goh","year":"2000","journal-title":"Data and Knowledge Engineering"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB11","series-title":"Proceedings ACM SIGMOD International Conference on Management of Data","first-page":"47","article-title":"R-trees: a dynamic index structure for spatial searching","author":"Guttman","year":"1984"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB12","series-title":"Proceedings ACM SIGMOD International Conference on Management of Data","first-page":"171","article-title":"Online aggregation","author":"Hellerstein","year":"1997"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB13","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","article-title":"The TV-tree: an index structure for high-dimensional data","volume":"3","author":"Lin","year":"1995","journal-title":"VLDB Journal"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB14","series-title":"Proceedings International Database Engineering and Applications Symposium IDEAS'01","first-page":"58","article-title":"Implementing KDB-trees to support high-dimensional data","author":"Orlandic","year":"2001"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB15","series-title":"Proceedings 26th International Conference on Very Large Data Bases","first-page":"263","article-title":"Integrating the UB-tree into a database system kernel","author":"Ramsak","year":"2000"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB16","series-title":"Proceedings ACM SIGMOD International Conference on Management of Data","first-page":"10","article-title":"The K\u2013D\u2013B tree: a search structure for large multidimensional dynamic indexes","author":"Robinson","year":"1981"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB17","series-title":"Proceedings 12th International Conference on Scientific and Statistical Database Management","first-page":"139","article-title":"Optimizing selections over databases","author":"Ross","year":"2000"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB18","series-title":"Proceedings 26th International Conference on Very Large Data Bases","first-page":"516","article-title":"The A-tree: an index structure for high-dimensional spaces using relative approximation","author":"Sakurai","year":"2000"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB19","series-title":"Proceedings 16th International Conference on Very Large Data Bases","first-page":"590","article-title":"The Buddy-tree: an efficient and robust access method for spatial data base systems","author":"Seeger","year":"1990"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB20","series-title":"Proceedings 11th International Conference on Scientific and Statistical Database Management","first-page":"214","article-title":"Multidimensional indexing and query coordination for tertiary storage management","author":"Shoshani","year":"1999"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB21","series-title":"Proceedings 12th International Conference on Scientific and Statistical Database Management","first-page":"196","article-title":"Coordinating simultaneous caching of file bundles from tertiary storage","author":"Shoshani","year":"2000"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB22","series-title":"Proceedings 24th International Conference on Very Large Data Bases","first-page":"194","article-title":"A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces","author":"Weber","year":"1998"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB23","series-title":"Proceedings 12th International Conference on Data Engineering","first-page":"516","article-title":"Similarity indexing with the SS-tree","author":"White","year":"1996"},{"key":"10.1016\/S0169-023X(02)00023-X_BIB24","series-title":"Proceedings 8th International Conference on Information and Knowledge Management CIKM'99","first-page":"5","article-title":"Simple QSF-trees: an efficient and scalable spatial access method","author":"Yu","year":"1999"}],"container-title":["Data & Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X0200023X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0169023X0200023X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:30:33Z","timestamp":1556818233000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0169023X0200023X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0169023X0200023X"],"URL":"https:\/\/doi.org\/10.1016\/s0169-023x(02)00023-x","relation":{},"ISSN":["0169-023X"],"issn-type":[{"value":"0169-023X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}