{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T18:27:39Z","timestamp":1693852059793},"reference-count":16,"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\/bf00289018","type":"journal-article","created":{"date-parts":[[2004,10,4]],"date-time":"2004-10-04T12:23:48Z","timestamp":1096892628000},"page":"423-452","source":"Crossref","is-referenced-by-count":8,"title":["Maintaining range trees in secondary memory"],"prefix":"10.1007","volume":"27","author":[{"given":"Mark H.","family":"Overmars","sequence":"first","affiliation":[]},{"given":"Michiel H. M.","family":"Smid","sequence":"additional","affiliation":[]},{"given":"Mark T.","family":"de Berg","sequence":"additional","affiliation":[]},{"given":"Marc J.","family":"van Kreveld","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.M.: Organisation and Maintenance of Large Ordered Indexes. Acta Inf. 1, 173?189 (1972)","journal-title":"Acta Inf."},{"key":"CR2","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":"CR3","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/0304-3975(80)90018-3","volume":"11","author":"N. Blum","year":"1980","unstructured":"Blum, N., Mehlhorn, K.: On the Average Number of Rebalancing Operations in Weight-Balanced Trees. Theor. Comput. Sci. 11, 303?320 (1980)","journal-title":"Theor. Comput. Sci."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1145\/356770.356776","volume":"11","author":"D. Comer","year":"1979","unstructured":"Comer, D.: The Ubiquitous B-tree. Comput. Surv. 11, 121?137 (1979)","journal-title":"Comput. Surv."},{"key":"CR5","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Reading, Mass.: Addison-Wesley 1989"},{"key":"CR6","doi-asserted-by":"crossref","unstructured":"Hinrichs, K.: The Grid File System: Implementation and Case Studies of Applications. ETH Z\u00fcrich: PhD Thesis 1985","DOI":"10.1007\/BF01936137"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/BF01936137","volume":"25","author":"K. Hinrichs","year":"1985","unstructured":"Hinrichs, K.: Implementation of the grid file: design concepts and experience. BIT 25, 569?592 (1985)","journal-title":"BIT"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"Lueker, G.S.: A Data Structure for Orthogonal Range Queries. Proc. 19-th Annual IEEE Symp. on Foundations of Computer Science, pp. 28?34, 1978","DOI":"10.1109\/SFCS.1978.1"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: The Grid File: An Adaptable, Symmetric Multikey File Structure. ACM Trans. Database Syst. 9, 38?71 (1984)","journal-title":"ACM Trans. Database Syst."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.M.: Binary Search Trees of Bounded Balance. SIAM J. Comput. 2, 33?43 (1973)","journal-title":"SIAM J. Comput."},{"key":"CR11","volume-title":"Lect. Notes Comput. Sci., vol. 156","author":"M.H. Overmars","year":"1983","unstructured":"Overmars, M.H.: The Design of Dynamic Data Structures. Lect. Notes Comput. Sci., vol. 156. Berlin Heidelberg New York: Springer 1983"},{"key":"CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry, an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry, an Introduction. Berlin Heidelberg New York: Springer 1985"},{"key":"CR13","unstructured":"Smid, M.H.M.: Dynamic Data Structures on Multiple Storage Media. University of Amsterdam: PhD Thesis 1989"},{"key":"CR14","unstructured":"Smid, M.H.M., Overmars, M.H.: Maintaining Range Trees in Secondary Memory, Part II: Lower Bounds. Report FVI-87-15, University of Amsterdam, 1987. Acta Inf. 27, 429?456"},{"key":"CR15","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":"CR16","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\/BF00289018.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00289018\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00289018","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\/BF00289018"}},"subtitle":["Part I: Partitions"],"short-title":[],"issued":{"date-parts":[[1990,4]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1990,4]]}},"alternative-id":["BF00289018"],"URL":"https:\/\/doi.org\/10.1007\/bf00289018","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,4]]}}}