{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:10Z","timestamp":1725664990101},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631415"},{"type":"electronic","value":"9783540691884"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63141-0_25","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:09:15Z","timestamp":1330297755000},"page":"361-375","source":"Crossref","is-referenced-by-count":2,"title":["A rigorous analysis of concurrent operations on B-trees"],"prefix":"10.1007","author":[{"given":"Anna","family":"Philippou","sequence":"first","affiliation":[]},{"given":"David","family":"Walker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"issue":"1","key":"25_CR1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1145\/151646.151651","volume":"15","author":"Y. Afek","year":"1993","unstructured":"Y. Afek, G. Brown, and M. Merritt. Lazy caching. ACM Transactions on Programming Languages and Systems, 15(1):182\u2013205, 1993.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"R. Bayer","year":"1972","unstructured":"R. Bayer and E. McCreight. Organisation and maintenance of large ordered indexes. Acta Informatica, 1:173\u2013189, 1972.","journal-title":"Acta Informatica"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"R. Bayer and M. Schkolnick. Concurrency of operations on B-trees. Acta Informatica, 9:1\u201321, 1977.","journal-title":"Acta Informatica"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"E. Brinksma. Cache consistency by design. Distributed Computing, to appear.","DOI":"10.1007\/s004460050058"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/22952.22954","volume":"12","author":"C. Ellis","year":"1987","unstructured":"C. Ellis. Concurrency in linear hashing. ACM Transactions on Database Systems, 12:195\u2013217, 1987.","journal-title":"ACM Transactions on Database Systems"},{"key":"25_CR6","unstructured":"R.van Glabbeek and P. Weijland. Branching time and abstraction in bisimulation semantics. In Information Processing '89, pages 613\u2013618, 1989."},{"key":"25_CR7","unstructured":"W. Janssen, M. Poel, and J. Zwiers. The compositional approach to sequential consistency and lazy caching. Technical report, Universiteit Twente, 1994."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TSE.1982.235251","volume":"SE-8","author":"Y. S. Kwong","year":"1982","unstructured":"Y. S. Kwong and D. Wood. A new method for concurrency in B-trees. IEEE Transactions on Software Engineering, SE-8:211\u2013222, 1982.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"25_CR9","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1145\/319628.319663","volume":"6","author":"P. Lehman","year":"1981","unstructured":"P. Lehman and S. B. Yao. Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems, 6:650\u2013670, 1981.","journal-title":"ACM Transactions on Database Systems"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"X. Liu and D. Walker. Confluence of processes and systems of objects. In Proceedings of TAPSOFT'95, pages 217\u2013231. Springer, 1995.","DOI":"10.1007\/3-540-59293-8_197"},{"key":"25_CR11","unstructured":"N. Lynch, M. Merritt, W. Weihl, and A. Fekete. Atomic Transactions. Morgan Kaufmann, 1994."},{"key":"25_CR12","unstructured":"R. Miller and L. Snyder. Multiple access to B-trees. In Information Science and Systems, Baltimore, 1978."},{"key":"25_CR13","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts 1 and 2. Information and Computation, 100:1\u201377, 1992.","journal-title":"Information and Computation"},{"key":"25_CR15","unstructured":"A. Philippou. Reasoning about systems with evolving structure. PhD thesis, University of Warwick, 1996."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"A. Philippou and D. Walker. On transformations of concurrent object programs. In Proceedings of CONCUR'96, pages 131\u2013146. Springer, 1996.","DOI":"10.1007\/3-540-61604-7_52"},{"key":"25_CR17","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0022-0000(86)90021-8","volume":"33","author":"Y. Sagiv","year":"1986","unstructured":"Y. Sagiv. Concurrent operations on B*-trees with overtaking. Journal of Computer and System Sciences, 33:275\u2013296, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"25_CR18","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0020-0190(76)90005-3","volume":"5","author":"B. Samadi","year":"1976","unstructured":"B. Samadi. B-trees in a system with multiple users. Information Processing Letters, 5:107\u2013112, 1976.","journal-title":"Information Processing Letters"},{"key":"25_CR19","unstructured":"C. Tofts. Proof methods and pragmatics for parallel programming. PhD thesis, University of Edinburgh, 1990."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"F. Vaandrager. On the relationship between process algebra and input\/output automata. In Proceedings of LICS'91, pages 387\u2013398. Springer, 1991.","DOI":"10.1109\/LICS.1991.151662"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"D. Walker. Algebraic proofs of properties of objects. In Proceedings of ESOP'94, pages 501\u2013516. Springer, 1994.","DOI":"10.1007\/3-540-57880-3_33"},{"key":"25_CR22","unstructured":"H. Wedekind. On the selection of access paths in a data base system. In Data base managememt, pages 385\u2013397. North-Holland, 1974."}],"container-title":["Lecture Notes in Computer Science","CONCUR '97: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63141-0_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:42:08Z","timestamp":1619574128000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63141-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631415","9783540691884"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-63141-0_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}