{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:27:28Z","timestamp":1778300848516,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540194224","type":"print"},{"value":"9783540392644","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-19422-3_7","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:09:58Z","timestamp":1330200598000},"page":"84-93","source":"Crossref","is-referenced-by-count":14,"title":["Priority search trees in secondary memory (extended abstract)"],"prefix":"10.1007","author":[{"given":"Ch.","family":"Icking","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Klein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Th.","family":"Ottmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer, Symmetric Binary B-trees: Data Structure and Maintenance Algorithms, Acta Informatica, 1 (1972), pp. 290\u2013306.","journal-title":"Acta Informatica"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer, E. McCreight, Organization of Large Ordered Indexes, Acta Informatica, 1 (1972), pp. 173\u2013189.","journal-title":"Acta Informatica"},{"key":"7_CR3","first-page":"118","volume":"32","author":"H. Edelsbrunner","year":"1987","unstructured":"H. Edelsbrunner, Geometrics and Algorithmics \u2014 A Tutorial in Computational Geometry, Bulletin of the EATCS, 32 (1987), pp. 118\u2013142.","journal-title":"Bulletin of the EATCS"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"L. J. Guibas, R. Sedgewick, A Dichromatic Framework for Balanced trees, 19th Annual IEEE Symposium. on Foundations of Computer Science, 1978, pp. 8\u201321.","DOI":"10.1109\/SFCS.1978.3"},{"key":"7_CR5","unstructured":"K. Hinrichs, The Grid File System: Implementation and Case Studies of Applications, Dissertation at the Swiss Federal Institute of Technology Z\u00fcrich, ETH Z\u00fcrich, 1985."},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"R. Klein, O. Nurmi, Th. Ottmann, D. Wood, Optimal Dynamic Solutions for Fixed Windowing Problems, Proceedings of the 2nd Annual Symposium on Computational Geometry, 1986, pp. 109\u2013115, (to appear in Algorithmica).","DOI":"10.1145\/10515.10527"},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1137\/0214021","volume":"14","author":"E. M. McCreight","year":"1985","unstructured":"E. M. McCreight, Priority Search Trees, SIAM J. Comput., 14 (1985), pp. 257\u2013276.","journal-title":"SIAM J. Comput."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data Structures and Algorithms 1: Sorting and Searching, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69672-5"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry, EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-642-69900-9"},{"issue":"1","key":"7_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/348.318586","volume":"9","author":"J. Nievergelt","year":"1984","unstructured":"J. Nievergelt, H. Hinterberger, K. C. Sevcik, The Grid File: An Adaptable Symmetric Multikey File Structure, ACM Transactions on Data Base Systems, 9(1) (1984), pp. 38\u201371.","journal-title":"ACM Transactions on Data Base Systems"},{"key":"7_CR11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1051\/ita\/1982160100511","volume":"16","author":"H. J. Olivi\u00e9","year":"1982","unstructured":"H. J. Olivi\u00e9, A New Class of Balanced Trees: Half Balanced Binary Search Trees, RAIRO Informatique Th\u00e9orique, 16 (1982), pp. 51\u201371.","journal-title":"RAIRO Informatique Th\u00e9orique"},{"key":"7_CR12","first-page":"395","volume":"9","author":"T. Ottmann","year":"1976","unstructured":"Th. Ottmann, H.-W. Six, Eine neue Klasse von ausgeglichenen Bin\u00e4rb\u00e4umen, Angewandte Informatik, 9 (1976), pp. 395\u2013400.","journal-title":"Angewandte Informatik"},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0020-0190(83)90099-6","volume":"16","author":"R. E. Tarjan","year":"1983","unstructured":"R. E. Tarjan, Updating a Balanced Search Tree in O(1) Rotations, Information Processing Letters, 16 (1983), pp. 253\u2013257.","journal-title":"Information Processing Letters"}],"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-19422-3_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:17:10Z","timestamp":1605644230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-19422-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540194224","9783540392644"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-19422-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1988]]}}}