Abstract
In the presence of semantic information, serializability is too strong a correctness criterion and unnecessarily restricts concurrency. Many researchers have investigated the use of semantic information to allow interleaving among transactions which are non-serializable, but which nonetheless preserves the consistency of the database and is acceptable to the users. In this paper we consider a class of schedules, calledconflict-correct schedules, first proposed by Farrag and Özsu, which enlarges upon the class of serializable schedules by taking semantic information of transactions into account. In this paper we show that the problem of recognizing schedules in this class is NP-complete. Thus it is unlikely that there exists an efficient scheduler which accepts the entire class of conflict-correct schedules.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Badrinath, B.R., Ramamritham, K.: Semantics-based concurrency control: beyond commutativity. ACM Trans. Database Syst.17 (1) 163–199 (1992)
Berstein, P.A., Shipman, D.W. and Wong, W.S.: Formal aspects of serializability in database concurrency control. IEEE Trans. Software Eng.5 (5) 203–216 (1979)
Casanova, M.A., Bernstein, P.A.: General purpose schedulers for database systems. Acta Inf.4 185–221 (1980)
Eswaran, K.P., Gray, J.N., Lorie, R.A., Traiger, I.L.: The notions of consistency and predicate locks in database systems. Commun. ACM19 (11) 624–633 (1976)
Farrag, A.A., Özsu, M.T.: Using semantic knowledge of transactions to increase concurrency. ACM Trans. Database Syst.14 (4) 503–525 (1989)
Fischer, J.M., Griffeth, N.D., Lynch, N.A.: Global states of a distributed system. IEEE Trans. Software Eng. SE-8 (3) 198–202 (1982)
Garcia Molina, H.: Using semantic knowledge for transaction processing in a distributed database. ACM Trans. Database Syst.8 (2) 186–213 (1983)
Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. New York: S.H. Freeman 1979
Gray, J.N.: The transaction concept: Virtues and limitations. In: Proceedings of the 7th International Conference on Very Large Data Bases, pp. 144–154, September 1981
Kung, H.T., Papadimitriou, C.H.: An optimality theory of concurrency control for databases. In: Proceedings ACM-SIGMOD International Conference on Management of Data, Boston, MA, May 30–June 1, ACM, New York, pp. 116–126, 1979
Lynch, N.A.: Multilevel atomicity—a new correctness criterion for database concurrency control. ACM Trans. Database Syst.8 (4) 484–502 (1983)
Papadimitriou, C.H.: The theory of database concurrency control. New York: Computer Science Press 1986
Papadimitriou, C.H.: The serializability of concurrent database updates. J. ACM26 (4) 631–653 (1979)
Rosenkrantz, D.J., Stearns, R.E., Lewis, P.M.: System level concurrency control for distributed database systems. ACM Trans. Database Syst.3 (2) 178–198 (1978)
Author information
Authors and Affiliations
Additional information
This research was partially supported by MICRO grants with IBM and XEROX Corporations.
Rights and permissions
About this article
Cite this article
Krishnaswamy, V., Bruno, J. On the complexity of concurrency control using semantic information. Acta Informatica 32, 271–284 (1995). https://doi.org/10.1007/BF01178262
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01178262