Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
The theory of database concurrency control
The theory of database concurrency control
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Abstraction in recovery management
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Nested transactions and read-write locking
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
SOSP '87 Proceedings of the eleventh ACM Symposium on Operating systems principles
On long-duration CAD transactions
Information Sciences: an International Journal
The serializability of concurrent database updates
Journal of the ACM (JACM)
A Theory of Safe Locking Policies in Database Systems
Journal of the ACM (JACM)
Locking Primitives in a Database System
Journal of the ACM (JACM)
The notions of consistency and predicate locks in a database system
Communications of the ACM
On concurrency control by multiple versions
PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
A Transaction Mechanism for Engineering Design Databases
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Architectural Issues of Transaction Management in Multi-Layered Systems
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Node autonomy in distributed systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Quasi serializability: a correctness criterion for global concurrency control in InterBase
VLDB '89 Proceedings of the 15th international conference on Very large data bases
Bounded ignorance in replicated systems
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control in advanced database applications
ACM Computing Surveys (CSUR)
Quantifying the benefits of semantics
CSC '92 Proceedings of the 1992 ACM annual conference on Communications
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)
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
A concurrency control framework for collaborative systems
CSCW '96 Proceedings of the 1996 ACM conference on Computer supported cooperative work
Applying formal methods to semantic-based decomposition of transactions
ACM Transactions on Database Systems (TODS)
Real-Time Data Semantics and Similarity-Based Concurrency Control
IEEE Transactions on Computers
Real-time database — similarity and resource scheduling
ACM SIGMOD Record
Cooperative transaction hierarchies: transaction support for design applications
The VLDB Journal — The International Journal on Very Large Data Bases
Overview of multidatabase transaction management
The VLDB Journal — The International Journal on Very Large Data Bases
Chronological scheduling of transactions with temporal dependencies
The VLDB Journal — The International Journal on Very Large Data Bases
The demarcation protocol: a technique for maintaining constraints in distributed database systems
The VLDB Journal — The International Journal on Very Large Data Bases
A Formal Characterization of Epsilon Serializability
IEEE Transactions on Knowledge and Data Engineering
Divergence Control Algorithms for Epsilon Serializability
IEEE Transactions on Knowledge and Data Engineering
Flexible Robust Programming in Distributed Object Systems
IEEE Transactions on Knowledge and Data Engineering
A Formal Approach to Recovery by Compensating Transactions
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Triggered Real-Time Databases with Consistency Constraints
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Proclamation-Based Model for Cooperating Transactions
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Using Formal Methods to Reason about Semantics-Based Decompositions of Transactions
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Global Semantic Serializability: An Approach to Increase Concurrency in Multidatabase Systems
CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
A Formalism for Extended Transaction Model
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A taxonomy of correctness criteria in database applications
The VLDB Journal — The International Journal on Very Large Data Bases
Overview of multidatabase transaction management
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
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
Overview of multidatabase transaction management
CASCON First Decade High Impact Papers
Hi-index | 0.00 |
In the classical approach to transaction processing, a concurrent execution is considered to be correct if it is equivalent to a non-concurrent schedule. This notion of correctness is called serializability. Serializability has proven to be a highly useful concept for transaction systems for data-processing style applications. Recent interest in applying database concepts to applications in computer-aided design, office information systems, etc. has resulted in transactions of relatively long duration. For such transactions, there are serious consequences to requiring serializability as the notion of correctness. Specifically, such systems either impose long-duration waits or require the abortion of long transactions. In this paper, we define a transaction model that allows for several alternative notions of correctness without the requirement of serializability. After introducing the model, we investigate classes of schedules for transactions. We show that these classes are richer than analogous classes under the classical model. Finally, we show the potential practicality of our model by describing protocols that permit a transaction manager to allow correct non-serializable executions