{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T05:26:21Z","timestamp":1737177981155,"version":"3.33.0"},"reference-count":28,"publisher":"Informa UK Limited","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1080\/00207169608804523","type":"journal-article","created":{"date-parts":[[2007,6,26]],"date-time":"2007-06-26T00:21:21Z","timestamp":1182817281000},"page":"23-44","source":"Crossref","is-referenced-by-count":5,"title":["Relaxed avl trees, main-memory databases and concurrency"],"prefix":"10.1080","volume":"62","author":[{"given":"Otto","family":"Nurmi","sequence":"first","affiliation":[]},{"given":"Eljas","family":"Soislon-Soininen","sequence":"additional","affiliation":[]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"CIT0001","first-page":"263","volume":"146","author":"Adel'son-Vel'skii G. M.","year":"1962","journal-title":"Doklady Akademi Nauk"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1145\/359460.359470"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1007\/BF00263762"},{"key":"CIT0005","first-page":"151","volume":"92","author":"Boyar J.","year":"1992","journal-title":"In Proceeding of Third Scandinavian Workshop on Algorithm Theory-SWAT"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80075-3"},{"key":"CIT0007","unstructured":"Boyar, J., Fegerberg, R. and Larsen, K. S. 1995. Amortization results for chromatic search trees, with an application to priority queues. Proceedings of the fourth International Workshop on Algorithms and Data Structures, WADS. 1995. Vol. 95, pp.270\u2013281."},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1145\/359642.359655"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675680"},{"key":"CIT0010","unstructured":"Guibas, L. J. and Sedgewick, R. 1978. A dichromatic framework for balanced trees. Proceeding of the 19th Annual Symposium on Foundations of Computer Science. 1978. Vol. 29, pp.8\u201321."},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1145\/182.358442"},{"key":"CIT0012","volume-title":"Sorting and Searching","volume":"3","author":"Knuth D. E.","year":"1973"},{"key":"CIT0013","first-page":"339","volume":"3","author":"Kung H. T.","year":"1980","journal-title":"ACM Transactions on Database Systems"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022520"},{"key":"CIT0015","doi-asserted-by":"crossref","unstructured":"Larsen, K. S. 1994. AVL trees with relaxed balance. Proceedings of the Eighth International Parallel Processing Symposium. 1994. pp.888\u2013893.","DOI":"10.1109\/IPPS.1994.288201"},{"key":"CIT0016","doi-asserted-by":"crossref","unstructured":"Larsen, K S. and Fagerberg, R. 1995. B-trees with relaxed balance. Proceedings of the Ninth International Parallel Processing Symposium. 1995. pp.196\u2013202.","DOI":"10.1109\/IPPS.1995.395932"},{"volume-title":"A Study of Index Structures for Main Memory Database Management Systems","year":"1986","author":"Lehman J.","key":"CIT0017"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1145\/1270.318576"},{"key":"CIT0019","doi-asserted-by":"crossref","unstructured":"Nurmi, O. and Soisalon-Soininen, E. 1991. Uncoupling updating and rebalancing in chromatic binary search trees. Proceedings of the 10th ACM Symposium on Principles of Database Systems. 1991. pp.192\u2013198.","DOI":"10.1145\/113413.113430"},{"journal-title":"Chromatic binary search trees : A structure for concurrent rebalancing. Acta Informatica","year":"1996","author":"Nurmi O.","key":"CIT0020"},{"key":"CIT0021","doi-asserted-by":"crossref","unstructured":"Nurmi, O., Soisalon-Soininen, E. and Wood, D. 1987. Concurrency control in database structures with relaxed balance. Proceedings of the Sixth ACM Symposium on Principles of Database Systems. 1987. pp.170\u2013176.","DOI":"10.1145\/28659.28677"},{"volume-title":"Relaxed AVLTrees, Main-Memory Databases, and Concurrency","year":"1993","author":"Nurmi O.","key":"CIT0022"},{"key":"CIT0023","unstructured":"Ottmann Th. Soisalon-Soininen E. Relaxed balancing made simple. Unpublished manuscript 1996"},{"key":"CIT0024","doi-asserted-by":"publisher","DOI":"10.1007\/BF00290147"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(86)90021-8"},{"key":"CIT0026","unstructured":"Soisalon-Soininen E. Widmayer P. Relaxed balancing in binary search trees. Unpublished manuscript 1995"},{"volume-title":"AVLTrees, On-The-Fly Restructuring, and Concurrency","year":"1986","author":"Soisalon-Soininen E.","key":"CIT0027"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1145\/6592.6599"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207169608804523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T21:39:57Z","timestamp":1737149997000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207169608804523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1080\/00207169608804523"],"URL":"https:\/\/doi.org\/10.1080\/00207169608804523","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"type":"print","value":"0020-7160"},{"type":"electronic","value":"1029-0265"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}