{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T19:38:18Z","timestamp":1703187498508},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1990,4,1]],"date-time":"1990-04-01T00:00:00Z","timestamp":638928000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1990,4]]},"DOI":"10.1007\/bf00289019","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T12:23:48Z","timestamp":1096892628000},"page":"453-480","source":"Crossref","is-referenced-by-count":7,"title":["Maintaining range trees in secondary memory"],"prefix":"10.1007","volume":"27","author":[{"given":"Michiel H. M.","family":"Smid","sequence":"first","affiliation":[]},{"given":"Mark H.","family":"Overmars","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0020-0190(79)90117-0","volume":"8","author":"J.L. Bentley","year":"1979","unstructured":"Bentley, J.L.: Decomposable searching problems. Inform. Proc. Lett. 8, 244?251 (1979)","journal-title":"Inform. Proc. Lett."},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: A data structure for orthogonal range queries. Proc. 19th Annual IEEE Symp. on Foundations of Computer Science, pp. 28?34, 1978","DOI":"10.1109\/SFCS.1978.1"},{"key":"CR3","unstructured":"Overmars, M.H., Smid, M.H.M., de Berg, M.T., van Kreveld, M.J.: Maintaining range trees in secondary memory, part I: Partitions. Report FVI-87-14, University of Amsterdam, 1987. Acta Inf. 27, 399?428"},{"key":"CR4","first-page":"131","volume":"25","author":"M.H.M. Smid","year":"1989","unstructured":"Smid, M.H.M., Torenvliet, L., van Emde Boas, P., Overmars, M.H.: Two models for the reconstruction problem for dynamic data structures. J. Inf. Process. Cybern. EIK 25, 131?155 (1989)","journal-title":"J. Inf. Process. Cybern. EIK"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1145\/3828.3839","volume":"32","author":"D.E. Willard","year":"1985","unstructured":"Willard, D.E., Lueker, G.S.: Adding range restriction capability to dynamic data structures. J. ACM 32, 597?617 (1985)","journal-title":"J. ACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289019.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289019\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289019","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,8]],"date-time":"2019-04-08T17:14:37Z","timestamp":1554743677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00289019"}},"subtitle":["Part II: Lower bounds"],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":5,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["BF00289019"],"URL":"https:\/\/doi.org\/10.1007\/bf00289019","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}