{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T19:53:52Z","timestamp":1649015632371},"reference-count":31,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0022-0000(03)00027-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T01:09:12Z","timestamp":1052788152000},"page":"657-670","source":"Crossref","is-referenced-by-count":2,"title":["Relaxed multi-way trees with group updates"],"prefix":"10.1016","volume":"66","author":[{"given":"Kim S.","family":"Larsen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00027-8_BIB1","first-page":"263","article-title":"An algorithm for the organisation of information","volume":"146","author":"Adel'son-Vel'ski\u0131\u0306","year":"1962","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB2","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","article-title":"Symmetric binary B-trees","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB4","series-title":"Proceedings of the Third Annual European Conference on Parallel Processing","first-page":"421","article-title":"Concurrent rebalancing of AVL trees: a fine-grained approach","volume":"Vol. 1300","author":"Boug\u00e9","year":"1997"},{"issue":"3","key":"10.1016\/S0022-0000(03)00027-8_BIB5","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1006\/jcss.1997.1511","article-title":"Amortization results for chromatic search trees, with an application to priority queues","volume":"55","author":"Boyar","year":"1997","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0022-0000(03)00027-8_BIB6","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/S0022-0000(05)80075-3","article-title":"Efficient rebalancing of chromatic search trees","volume":"49","author":"Boyar","year":"1994","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/S0022-0000(03)00027-8_BIB7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1145\/360762.360766","article-title":"Analysis and performance of inverted data base structures","volume":"18","author":"Cardenas","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB8","series-title":"Third International Conference on Extending Database Technology","first-page":"310","article-title":"Hybrid index organizations for text databases","volume":"Vol. 580","author":"Faloutsos","year":"1992"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB9","doi-asserted-by":"crossref","unstructured":"L.J. Guibas, R. Sedgewick, A dichromatic framework for balanced trees, in: Proceedings of the 19th Annual IEEE Symposium on the Foundations of Computer Science, Los Alamitos, California, 1978, pp. 8\u201321.","DOI":"10.1109\/SFCS.1978.3"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB10","series-title":"Proceedings of the Third International Workshop on Algorithm Engineering","first-page":"286","article-title":"The performance of concurrent red-black tree algorithms","volume":"Vol. 1668","author":"Hanke","year":"1999"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB11","series-title":"Proceedings of the Third Italian Conference on Algorithms and Complexity","first-page":"193","article-title":"Relaxed balanced red-black trees","volume":"Vol. 1203","author":"Hanke","year":"1997"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB12","series-title":"Proceedings of the Fourth Italian Conference on Algorithms and Complexity","first-page":"253","article-title":"Group updates for red-black trees","volume":"Vol. 1767","author":"Hanke","year":"2000"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00288968","article-title":"A new data structure for representing sorted lists","volume":"17","author":"Huddleston","year":"1982","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0022-0000(03)00027-8_BIB14","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1142\/S012905410100059X","article-title":"Variants of (a,b)-trees with relaxed balance","volume":"12","author":"Jacobsen","year":"2001","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0020-0190(02)00228-4","article-title":"On the existence and construction of non-extreme (a,b)-trees","volume":"84","author":"Jacobsen","year":"2002","journal-title":"Tech. Inform. Process. Lett."},{"issue":"2","key":"10.1016\/S0022-0000(03)00027-8_BIB16","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0306-4379(86)90005-0","article-title":"Batch insertion for tree structured file organizations\u2014improving differential database representation","volume":"11","author":"Lang","year":"1986","journal-title":"Inform. Systems"},{"issue":"10","key":"10.1016\/S0022-0000(03)00027-8_BIB17","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s002360050145","article-title":"Amortized constant relaxed rebalancing using standard rotations","volume":"35","author":"Larsen","year":"1998","journal-title":"Acta Inform."},{"issue":"3","key":"10.1016\/S0022-0000(03)00027-8_BIB18","doi-asserted-by":"crossref","first-page":"508","DOI":"10.1006\/jcss.2000.1705","article-title":"AVL trees with relaxed balance","volume":"61","author":"Larsen","year":"2000","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"10.1016\/S0022-0000(03)00027-8_BIB19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1142\/S0129054196000142","article-title":"Efficient rebalancing of B-trees with relaxed balance","volume":"7","author":"Larsen","year":"1996","journal-title":"Internat. J. Found. Comput. Sci."},{"issue":"10","key":"10.1016\/S0022-0000(03)00027-8_BIB20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1007\/PL00013303","article-title":"Relaxed balance for search trees with local rebalancing","volume":"37","author":"Larsen","year":"2001","journal-title":"Acta Inform."},{"issue":"4","key":"10.1016\/S0022-0000(03)00027-8_BIB21","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s00453-001-0059-x","article-title":"Relaxed balance through standard rotations","volume":"31","author":"Larsen","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB22","series-title":"Proceedings of the 18th ACM SIGMOD\u2013SIGACT\u2013SIGART Symposium on Principles of Database Systems","first-page":"358","article-title":"Group updates for relaxed height-balanced trees","author":"Malmi","year":"1999"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB23","article-title":"Sorting and Searching","volume":"Vol. 1","author":"Mehlhorn","year":"1986"},{"issue":"1","key":"10.1016\/S0022-0000(03)00027-8_BIB24","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1137\/0215002","article-title":"An amortized analysis of insertions into AVL-trees","volume":"15","author":"Mehlhorn","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB25","series-title":"Proceedings of the 11th ACM SIGMOD International Conference on Management of Data","first-page":"361","article-title":"Algorithms for creating indexes for very large tables without quiescing updates","author":"Mohan","year":"1992"},{"issue":"6","key":"10.1016\/S0022-0000(03)00027-8_BIB26","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s002360050057","article-title":"Chromatic binary search trees\u2014a structure for concurrent rebalancing","volume":"33","author":"Nurmi","year":"1996","journal-title":"Acta Inform."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB27","doi-asserted-by":"crossref","unstructured":"O. Nurmi, E. Soisalon-Soininen, D. Wood, Concurrency control in database structures with relaxed balance, in: Proceedings of the Sixth ACM Symposium on Principles of Database Systems, ACM, New York, 1987, pp. 170\u2013176.","DOI":"10.1145\/28659.28677"},{"key":"10.1016\/S0022-0000(03)00027-8_BIB28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/00207169608804523","article-title":"Relaxed AVL trees, main-memory databases and concurrency","volume":"62","author":"Nurmi","year":"1996","journal-title":"Internat. J. Comput. Math."},{"issue":"6","key":"10.1016\/S0022-0000(03)00027-8_BIB29","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1109\/69.553166","article-title":"Concurrency control in B-trees with batch updates","volume":"8","author":"Pollari-Malmi","year":"1996","journal-title":"IEEE Trans. Knowledge Data Eng."},{"key":"10.1016\/S0022-0000(03)00027-8_BIB30","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0022-0000(03)00027-8_BIB31","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","article-title":"Amortized computational complexity","volume":"6","author":"Tarjan","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000278?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000278?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T13:53:58Z","timestamp":1553176438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000278"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0022000003000278"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00027-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}