{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:52:47Z","timestamp":1725493967414},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_21","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T22:47:16Z","timestamp":1194130036000},"page":"253-262","source":"Crossref","is-referenced-by-count":0,"title":["Group Updates for Bed-Black Trees"],"prefix":"10.1007","author":[{"given":"Sabine","family":"Hanke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eljas","family":"Soisalon-Soininen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"21_CR1","first-page":"1259","volume":"3","author":"G.M. Adelson-Vels\u2019kii","year":"1962","unstructured":"G.M Adel\u2019son-Vels'kii and E.M. Landis. An algorithm for the organisation of information. Soviet Math. Dokl., 3:1259\u20131262, 1962.","journal-title":"Soviet Math. Dokl."},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1006\/jcss.1997.1511","volume":"55","author":"J. Boyar","year":"1997","unstructured":"J. Boyar, R. Fagerberg, and K. Larsen. Amortization results for chromatic search trees, with an application to priority queues. Journal of Computer and System Sciences, 55(3):504\u2013521, 1997.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"21_CR3","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1137\/0209045","volume":"9","author":"M. Brown","year":"1980","unstructured":"M. Brown and R. Tarjan. Design and analysis of a data structure for representing sorted lists. SIAM Journal of Computing, 9(3):594\u2013614, 1980.","journal-title":"SIAM Journal of Computing"},{"key":"21_CR4","unstructured":"C. Faloutsos and S. Christodoulakis. Design of a signature file method that accounts for non-uniform occurrence and query frequencies. In Proc. Intern. Conf. on Very Large Data Bases, pages 165\u2013180, 1985."},{"key":"21_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/BFb0032439","volume-title":"Proc. Advances in Database Technology","author":"C. Faloutsos","year":"1992","unstructured":"C. Faloutsos and H.V. Jagadish. Hybrid text organizations for text databases. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 310\u2013327, 1992."},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"L.J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th IEEE Symposium on Foundations of Computer Science, pages 8\u201321, 1978.","DOI":"10.1109\/SFCS.1978.3"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0306-4379(86)90005-0","volume":"11","author":"S.D. Lang","year":"1992","unstructured":"S.D. Lang, J.R. Driscoll, and J.H. Jou. Batch insertion for tree-structured file organizations improving defirential database representation. Information Systems, 11(2):167\u2013175, 1992.","journal-title":"Information Systems"},{"issue":"10","key":"21_CR8","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1007\/s002360050145","volume":"35","author":"K. Larsen","year":"1998","unstructured":"K. Larsen. Amortized constant relaxed rebalancing using standard rotations. Acta Informatica, 35(10):859\u2013874, 1998.","journal-title":"Acta Informatica"},{"key":"21_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1007\/3-540-63307-3_82","volume-title":"Proc. 5th Workshop on Algorithms and Data Structures","author":"K. Larsen","year":"1997","unstructured":"K. Larsen, E. Soisalon-Soininen, and P. Widmayer. Relaxed balance through standard rotations. In Proc. 5th Workshop on Algorithms and Data Structures, volume 1272 of LNCS, pages 450\u2013461, August 1997."},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"L. Malmi and E. Soisalon-Soininen. Group updates for relaxed height-balanced trees. In Proc. 18th ACM Symposium on the Principles of Database Systems, pages 358\u2013367, 1999.","DOI":"10.1145\/303976.304011"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"C. Mohan and I. Narang. Algorithms for creating indexes for very large tables without quiescing updates. In Proc. 19th ACM SIGMOD Conf. on the Management of Data, pages 361\u2013370, 1992.","DOI":"10.1145\/130283.130337"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s002360050057","volume":"33","author":"O. Nurmi","year":"1996","unstructured":"O. Nurmi and E. Soisalon-Soininen. Chromatic binary search trees: A structure for concurrent rebalancing. Acta Informatica, 33:547\u2013557, 1996.","journal-title":"Acta Informatica"},{"issue":"6","key":"21_CR13","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1109\/69.553166","volume":"8","author":"K. Pollari-Malmi","year":"1996","unstructured":"K. Pollari-Malmi, E. Soisalon-Soininen, and T. Y\u00f6nen. Concurrency control in Btrees with batch updates. IEEE Transactions on Knowledge and Data Enineering, 8(6):975\u2013983, 1996.","journal-title":"IEEE Transactions on Knowledge and Data Enineering"},{"key":"21_CR14","volume-title":"Master\u2019s thesis","author":"M. Rossi","year":"1997","unstructured":"M. Rossi. Concurrent full text database. Master\u2019s thesis, Department of Computer Science, Helsinki University of Technology, Department of Computer Science and Engineering, Finland, 1997."},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"E. Soisalon-Soininen and P. Widmayer. Concurrency and recovery in full-text indexing. In Proc. Symposium on String Processing and Information Retrieval (SPIRE'99), pages 192\u2013198. IEEE Computer Society, 1999.","DOI":"10.1109\/SPIRE.1999.796595"},{"key":"21_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BFb0032438","volume-title":"Proc. Advances in Database Technology","author":"V. Srinivasan","year":"1992","unstructured":"V. Srinivasan and M.J. Carey. Performance of on-line index construction algorithms. In Proc. Advances in Database Technology, volume 580 of LNCS, pages 293\u2013309, 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T23:01:49Z","timestamp":1551049309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_21","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}