Consistency and orderability: semantics-based correctness criteria for databases

The semantics of objects and transactions in database systems are investigated. User-defined predicates called consistency assertions are used to specify user programs. Three new correctness criteria are proposed. The first correctness criterion consistency is based solely on the users' specifications and admit nonserializable executions that are acceptable to the users. Integrity constraints of the database are maintained through consistency assertions. The second correctness criterion orderability is a generalization of view serializability and represents a weak notion of equivalence to a serial schedule. Finally, the third correctness criterion strong order-ability is introduced as a generalization of conflict serializability. Unlike consistency, the notions of orderability allow users to operate an isolation as maintenance of the integrity constrainst now becomes the responsibility of the database system.

[1]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[2]  Irving L. Traiger,et al.  The notions of consistency and predicate locks in a database system , 1976, CACM.

[3]  Harry B. Hunt,et al.  The complexity of testing predicate locks , 1979, SIGMOD '79.

[4]  Philip A. Bernstein,et al.  Formal Aspects of Serializability in Database Concurrency Control , 1979, IEEE Transactions on Software Engineering.

[5]  Christos H. Papadimitriou,et al.  The serializability of concurrent database updates , 1979, JACM.

[6]  Andreas Reuter,et al.  Concurrency on high-traffic data elements , 1982, PODS.

[7]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[8]  Nancy A. Lynch,et al.  Multilevel atomicity—a new correctness criterion for database concurrency control , 1983, TODS.

[9]  Hector Garcia-Molina,et al.  Using semantic knowledge for transaction processing in a distributed database , 1983, TODS.

[10]  Henry F. Korth,et al.  Locking Primitives in a Database System , 1983, JACM.

[11]  Alfred Z. Spector,et al.  Synchronizing shared abstract types , 1984, TOCS.

[12]  Serge Abiteboul,et al.  Transactions and integrity constraints , 1985, PODS '85.

[13]  D. Gawlick,et al.  Varieties of Concurrency Control in IMS/VS Fast Path. , 1985 .

[14]  William E. Weihl,et al.  Implementation of resilient, atomic data types , 1985, TOPL.

[15]  Gerhard Weikum,et al.  A theoretical foundation of multi-level concurrency control , 1985, PODS.

[16]  M. Herlihy.  A quorum-consensus replication method for abstract data types , 1986, TOCS.

[17]  Matthias Jarke,et al.  Adaptive Predicate Managers in Database Systems , 1986, VLDB.

[18]  James J. Horning,et al.  Report on the Larch Shared Language , 1986, Sci. Comput. Program..

[19]  Patrick E. O'Neil,et al.  The Escrow transactional method , 1986, TODS.

[20]  Edgar Knapp,et al.  Deadlock detection in distributed databases , 1987, CSUR.

[21]  B. R. Badrinath,et al.  Semantics-based concurrency control: Beyond commutativity , 1987, 1987 IEEE Third International Conference on Data Engineering.

[22]  William E. Weihl.  Commutativity-based concurrency control for abstract data types , 1988 .

[23]  Henry F. Korth,et al.  Formal model of correctness without serializabilty , 1988, SIGMOD '88.

[24]  Gottfried Vossen,et al.  Conceptual Level Concurrency Control of Relational Update Transactions , 1988, ICDT.

[25]  Theo Harder,et al.  Handling hot spot data in DB-sharing systems , 1988 .

[26]  Formal Model of Correctness Without Serializability , 1988, SIGMOD Conference.

[27]  Jim Gray,et al.  The Transaction Concept: Virtues and Limitations (Invited Paper) , 1981, VLDB.

[28]  William E. Weihl.  The impact of recovery on concurrency control , 1989, PODS '89.

[29]  M. Tamer Özsu,et al.  Using semantic knowledge of transactions to increase concurrency , 1989, TODS.

[30]  Catriel Beeri,et al.  A model for concurrency in nested transactions systems , 1989, JACM.

[31]  Nancy A. Lynch,et al.  Commutativity-Based Locking for Nested Transactions , 1990, J. Comput. Syst. Sci..

[32]  Stanley B. Zdonik,et al.  Concurrency Control and Object-Oriented Databases , 1989, Object-Oriented Concepts, Databases, and Applications.

[33]  William E. Weihl,et al.  Local atomicity properties: modular concurrency control for abstract data types , 1989, TOPL.

[34]  Gerhard Weikum,et al.  Multi-level recovery , 1990, PODS.

[35]  Abraham Silberschatz,et al.  A Formal Approach to Recovery by Compensating Transactions , 1990, VLDB.

[36]  Gerhard Weikum,et al.  Principles and realization strategies of multilevel transaction management , 1991, TODS.

[37]  Thanasis Hadzilacos,et al.  Transaction Synchronisation in Object Bases , 1991, J. Comput. Syst. Sci..

[38]  Maurice Herlihy,et al.  Hybrid Concurrency Control for Abstract Data Types , 1991, J. Comput. Syst. Sci..

[39]  Andreas Reuter,et al.  The ConTract Model , 1991, Database Transaction Models for Advanced Applications.

[40]  Hamid Pirahesh,et al.  ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging , 1998 .