Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Extending Multiversion Time-Stamping Protocols to Exploit Type Information
IEEE Transactions on Computers
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Modular Concurrency Control and Failure Recovery
IEEE Transactions on Computers
Formal model of correctness without serializabilty
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Fundamentals of database systems
Fundamentals of database systems
Using semantic knowledge of transactions to increase concurrency
ACM Transactions on Database Systems (TODS)
Quasi serializability: a correctness criterion for global concurrency control in InterBase
VLDB '89 Proceedings of the 15th international conference on Very large data bases
A formal approach to recovery by compensating transactions
Proceedings of the sixteenth international conference on Very large databases
A theory of relaxed atomicity (extended abstract)
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Hybrid concurrency control for abstract data types
Journal of Computer and System Sciences
An optimistic commit protocol for distributed transaction management
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
The Z notation: a reference manual
The Z notation: a reference manual
Simple rational guidance for chopping up transactions
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
An introduction to formal specification and Z
An introduction to formal specification and Z
Database transaction models for advanced applications
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
Synthesis of extended transaction models using ACTA
ACM Transactions on Database Systems (TODS)
Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model
ACM Transactions on Database Systems (TODS)
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems (TODS)
Verifying properties of parallel programs: an axiomatic approach
Communications of the ACM
Mutual Consistency in Decentralized Distributed Systems
Proceedings of the Third International Conference on Data Engineering
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Designing masking fault-tolerance via nonmasking fault-tolerance
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Exploiting transaction semantics in multidatabase systems
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Information systems research at George Mason University
ACM SIGMOD Record
Concurrency control: methods, performance, and analysis
ACM Computing Surveys (CSUR)
Communications of the ACM
Formalization of Workflows and Correctness Issues in the Presence of Concurrency
Distributed and Parallel Databases - Special issue on electronic commerce
Semantics-based transaction processing: satisfying conflicting objectives
IEEE Parallel & Distributed Technology: Systems & Technology
IEEE Parallel & Distributed Technology: Systems & Technology
Real-time update of access control policies
Data & Knowledge Engineering
Applying Semantic Knowledge to Real-Time Update of Access Control Policies
IEEE Transactions on Knowledge and Data Engineering
Automatic workflow verification and generation
Theoretical Computer Science
A lattice-based approach for updating access control policies in real-time
Information Systems
Dependability and flexibility centered approach for composite web services modeling
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part I
Hi-index | 0.02 |
In some database applications the traditional approach of seerializability, in which transactions appear to execute atomically and in isolation on a consistent database state, fails to satisfy performance requirements. Although many researchers have investigated the process of decomposing transactions into steps to increase concurrency, such research typically focuses on providing algorithms necessary to implement a decomposition supplied by the database application developer and pays relatively little attention to what constitutess a desirable decomposition or how the developer should obtain one. We focus onthe decomposition itself. A decomposition generates proof obligations whose descharge ensures desirable properties with respect to the original collection of transactions. We introduce the notion of semantic histories to formulate and prove the necessary properties, and the notion of successor sets to describe efficiently the correct interleavings of steps. The successor set constraints use information about conflicts between steps so as to take full advantage of conflict serializability at the level of steps. We propose a mechanism based on two-phase locking to generate correct stepwise serializable histories.