{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:06:14Z","timestamp":1747548374430},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540522928"},{"type":"electronic","value":"9783540469506"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52292-1_19","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:30:03Z","timestamp":1330205403000},"page":"260-276","source":"Crossref","is-referenced-by-count":5,"title":["Paging binary trees with external balancing"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Henrich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans-Werner","family":"Six","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Widmayer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"19_CR1","first-page":"1259","volume":"3","author":"G.M. Adelson-Velskii","year":"1962","unstructured":"Adelson-Velskii, G.M., Landis, E.M.: \u2018An algorithm for the organization of information', Soviet Math. Dokl. 3 (1962), 1259\u20131263","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"Bayer, R., McCreight, E.: \u2018Organization and maintenance of large ordered indexes', Acta Informatika 1, 3, 173\u2013189, 1972","journal-title":"Acta Informatika"},{"issue":"9","key":"19_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: \u2018Multidimensional Binary Search Trees Used in Database Applications', Communications of the ACM, Vol. 18, 9, 509\u2013517, 1975","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Freeston, M.: \u2018The BANG file: a new kind of grid file', Proc. ACM SIGMOD Int. Conf. on Management of Data, 260\u2013269, 1987","key":"19_CR4","DOI":"10.1145\/38713.38743"},{"doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Sedgewick, R.: \u2018A Dichromatic Framework for Balanced trees', 19th Annual IEEE Symposium on Foundations of Computer Science, 8\u201321, 1978","key":"19_CR5","DOI":"10.1109\/SFCS.1978.3"},{"unstructured":"Hinrichs, K.: \u2018The Grid File System: Implementation and Case Studies of Applications', Doctoral Thesis No. 7734, ETH Z\u00fcrich, 1985","key":"19_CR6"},{"doi-asserted-by":"crossref","unstructured":"Hutflez, A., Six, H.-W., Widmayer, P.: \u2018Globally Order Preserving Multidimensional Linear Hashing', Proc. IEEE 4th Int. Conf. on Data Engineering, 572\u2013579, 1988","key":"19_CR7","DOI":"10.1109\/ICDE.1988.105505"},{"doi-asserted-by":"crossref","unstructured":"Hutflez, A., Six, H.-W., Widmayer, P.: \u2018Twin Grid Files: Space Optimizing Access Schemes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 183\u2013190, 1988","key":"19_CR8","DOI":"10.1145\/50202.50222"},{"unstructured":"Henrich, A., Six, H.-W., Widmayer, P.: unpublished manuscript","key":"19_CR9"},{"doi-asserted-by":"crossref","unstructured":"Icking, Ch., Klein, R., Ottmann, Th.: \u2018Priority Search Trees in Secondary Memory', Universit\u00e4t Freiburg Institut f\u00fcr Informatik, Bericht 4, November 1987","key":"19_CR10","DOI":"10.1007\/3-540-19422-3_7"},{"doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Seeger, B.: \u2018Multidimensional Order Preserving Linear Hashing with Partial Expansions', Proc. Int. Conf. on Database Theory, 203\u2013220, 1986","key":"19_CR11","DOI":"10.1007\/3-540-17187-8_38"},{"doi-asserted-by":"crossref","unstructured":"Kriegel, H.-P., Seeger, B.: \u2018PLOP-Hashing: A Grid File without Directory', Proc. IEEE 4th Int. Conf. on Data Engineering, 369\u2013376, 1988","key":"19_CR12","DOI":"10.1109\/ICDE.1988.105439"},{"unstructured":"Krishnamurthy, R., Whang, K.-Y.: \u2018Multilevel Grid Files', IBM Research Report, Yorktown Heights, 1985","key":"19_CR13"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"Nievergelt, J., Hinterberger, H., Sevcik, K.C.: \u2018The Grid File: An Adaptable Symmetric Multikey File Structure', ACM Transactions on Database Systems, Vol. 9, 1, 38\u201371, 1984","journal-title":"ACM Transactions on Database Systems"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/0202005","volume":"2","author":"J. Nievergelt","year":"1973","unstructured":"Nievergelt, J., Reingold, E.M.: \u2018Binary Search Trees of Bounded Balance', SIAM J. Computing 2 (1973) 33\u201343","journal-title":"SIAM J. Computing"},{"doi-asserted-by":"crossref","unstructured":"Otoo, E.J.: \u2018Balanced Multidimensional Extendible Hash Tree', Proc. 5th ACM SIGACT \/ SIGMOD Symposium on Principles of Database Systems, 100\u2013113, 1986","key":"19_CR16","DOI":"10.1145\/6012.6015"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1093\/comjnl\/23.3.248","volume":"23","author":"T. Ottmann","year":"1981","unstructured":"Ottmann, Th., Wood, D.: \u20181\u20132 brother trees or AVL trees revisited', Comput. J., 23 (1981), 248\u2013255","journal-title":"Comput. J."},{"doi-asserted-by":"crossref","unstructured":"Robinson, J.T.: \u2018The K-D-B-Tree: A Search Structure for Large Multidimensional Dynamic Indexes', Proc. ACM SIGMOD Int. Conf. on Management of Data, 10\u201318, 1981","key":"19_CR18","DOI":"10.1145\/582318.582321"},{"unstructured":"Seeger, B., Kriegel, H.-P.: \u2018Techniques for Design and Implementation of Efficient Spatial Access Methods', Proc. 14th Int. Conf. on VLDB, 360\u2013371, 1988","key":"19_CR19"},{"unstructured":"Wirth, N.: \u2018Algorithmen und Datenstrukturen', B.G. Teubner, Stuttgart 1975","key":"19_CR20"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52292-1_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:23:51Z","timestamp":1605648231000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52292-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540522928","9783540469506"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-52292-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}