{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:38:30Z","timestamp":1649108310613},"reference-count":14,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"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":[[1998,10]]},"DOI":"10.1016\/s0020-0190(98)00128-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"97-105","source":"Crossref","is-referenced-by-count":3,"title":["Efficient dynamic range searching using data replication"],"prefix":"10.1016","volume":"68","author":[{"given":"K.V.","family":"Ravi Kanth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambuj","family":"Singh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00128-8_BIB1","series-title":"Proc. ACM SIGMOD Internat. Conf. 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)00128-8_BIB2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB3","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00263991","article-title":"Efficient worst-case data structures for range searching","volume":"13","author":"Bentley","year":"1980","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00128-8_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0196-6774(80)90015-2","article-title":"Decomposable searching problems 1: Static-to-dynamic transformation","volume":"1","author":"Bentley","year":"1980","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB5","series-title":"Proc. Conf. on Very Large Databases","article-title":"The X-tree: An index structure for high-dimensional data","author":"Berchtold","year":"1996"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB6","series-title":"Proc. ACM SIGMOD Internat. Conf. 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\/S0020-0190(98)00128-8_BIB7","series-title":"Data Structures and Algorithms 3: Multi-Dimensional Searching and Computational Geometry","author":"Mehlhorn","year":"1984"},{"issue":"4","key":"10.1016\/S0020-0190(98)00128-8_BIB8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0020-0190(81)90093-4","article-title":"Worst-case optimal insertion and deletion methods for decomposable searching problems","volume":"12","author":"Overmars","year":"1981","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(98)00128-8_BIB9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BF00264354","article-title":"Dynamic multidimensional data structures based on quad and k-d trees","volume":"17","author":"Overmars","year":"1982","journal-title":"Acta Inform."},{"key":"10.1016\/S0020-0190(98)00128-8_BIB10","article-title":"The Design of Dynamic Data Structures","volume":"Vol. 156","author":"Overmars","year":"1983"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB11","article-title":"Optimal dynamic range searching in non-replicating index structures","author":"Ravi Kanth","year":"1997"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB12","article-title":"Dynamic range searching using data replication","author":"Ravi Kanth","year":"1997"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB13","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1007\/BF01759075","article-title":"The divided k-d tree","volume":"6","author":"van Kreveld","year":"1991","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(98)00128-8_BIB14","series-title":"Proc. ACM Symposium on Computational Geometry","first-page":"80","article-title":"On the application of sheared retrieval to orthogonal range queries","author":"Willard","year":"1986"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001288?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098001288?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T12:54:54Z","timestamp":1556628894000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098001288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0020019098001288"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00128-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}