{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:25Z","timestamp":1725663385406},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540507284"},{"type":"electronic","value":"9783540460763"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-50728-0_38","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:33:16Z","timestamp":1330183996000},"page":"107-121","source":"Crossref","is-referenced-by-count":1,"title":["Serializable graphs"],"prefix":"10.1007","author":[{"given":"K.","family":"Vidyasankar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Beeri, C., Bernstein, P.A., Goodman, N., Lai, M.Y., and Shasha, D.E. A concurrency control theory for nested transactions. Proc. 2nd ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, August 1983.","DOI":"10.1145\/800221.806709"},{"issue":"3","key":"7_CR2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TSE.1979.234182","volume":"SE-5","author":"P.A. Bernstein","year":"1979","unstructured":"Bernstein, P.A., Shipman, D.W., and Wong, W.S. Formal aspects of serializability in database concurrency control, IEEE Trans. Software Eng. SE-5, 3 (May 1979), 203\u2013215.","journal-title":"IEEE Trans. Software Eng."},{"key":"7_CR3","series-title":"Technical Report","volume-title":"On models of transactions","author":"J.A. Brzozowski","year":"1984","unstructured":"Brzozowski, J.A. On models of transactions. Technical Report #84001, Department of Applied Mathematics and Physics, Kyoto University, Japan, April 1984."},{"issue":"11","key":"7_CR4","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1145\/360363.360369","volume":"19","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Gray, J.N., Lorie, R.A. and Traiger, I.L. The notions of consistency and predicate locks in a database system. Comm. ACM 19, 11 (Nov. 1976), 624\u2013633.","journal-title":"Comm. ACM"},{"issue":"3","key":"7_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1145\/27629.214284","volume":"12","author":"T. Ibaraki","year":"1987","unstructured":"Ibaraki, T., Kameda, T., and Minoura, T. Serializability with constraints, ACM TODS 12, 3(Sept. 1987), 429\u2013452.","journal-title":"ACM TODS"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Lynch, N.A. Concurrency control for resilient nested transactions. Proc. 2nd ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, March 1983, 166\u2013181.","DOI":"10.1145\/588058.588080"},{"key":"7_CR7","series-title":"Technical Report","volume-title":"Nested transactions: an approach to reliable distributed computing","author":"T.E.B. Moss","year":"1981","unstructured":"Moss, T.E.B. Nested transactions: an approach to reliable distributed computing. Ph.D. Thesis, Technical Report MIT\/LCS\/TR-260, MIT Laboratory for Computer Science, Cambridge, MA. 1981."},{"issue":"4","key":"7_CR8","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/322154.322158","volume":"26","author":"C.H. Papadimitriou","year":"1979","unstructured":"Papadimitriou, C.H. The serializability of concurrent database updates. J. ACM 26, 4(Oct. 1979), 631\u2013653.","journal-title":"J. ACM"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Sethi, R. A model of concurrent database transactions. Proc. 22nd IEEE Symp. Foundation of Comp. Sci., Oct. 1981, 175\u2013184.","DOI":"10.1109\/SFCS.1981.8"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/3-540-16042-6_18","volume-title":"Proc. 5th Conf. on Foundations of Software Technology and Theoretical Computer Science, India","author":"K. Vidyasankar","year":"1985","unstructured":"Vidyasankar, K. A simple characterization of database serializability. Proc. 5th Conf. on Foundations of Software Technology and Theoretical Computer Science, India, Lecture Notes in Computer Science 206, Berlin, Heidelberg, New York: Springer 1985, 329\u2013345."},{"issue":"1","key":"7_CR11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00290709","volume":"24","author":"K. Vidyasankar","year":"1987","unstructured":"Vidyasankar, K. Generalized theory of serializability. Acta Informatica 24, 1(Feb. 1987), 105\u2013119.","journal-title":"Acta Informatica"},{"issue":"2","key":"7_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1145\/62.322425","volume":"31","author":"M. Yannakakis","year":"1984","unstructured":"Yannakakis, M. Serializability by locking. J. ACM 31, 2(April 1984), 227\u2013244.","journal-title":"J. ACM"}],"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-50728-0_38.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:18:44Z","timestamp":1605629924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50728-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540507284","9783540460763"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-50728-0_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}