Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Camelot and Avalon: a distributed transaction facility
Camelot and Avalon: a distributed transaction facility
Orange locking: channel-free database concurrency control via locking
Results of the Sixth Working Conference of IFIP Working Group 11.3 on Database Security on Database security, VI : status and prospects: status and prospects
Coordinator log transaction execution protocol
Distributed and Parallel Databases
Integrating Concurrency Control and Commit Algorithms in Distributed Multilevel Secure Databases
Proceedings of the IFIP WG11.3 Working Conference on Database Security VII
Degrees of Isolation, Concurrency Control Protocols, and Commit Protocols
Proceedings of the IFIP WG11.3 Working Conference on Database Security VII
An extended transaction model approach for multilevel secure transaction processing
Das'01 Proceedings of the fifteenth annual working conference on Database and application security
Secure transaction management protocols for MLS/DDBMS
ICISS'07 Proceedings of the 3rd international conference on Information systems security
| Hi-index | 0.00 |
The classical Early Prepare commit protocol (EP), used in many commercial systems, is not suitable for use in multilevel secure distributed databases systems that employ a locking protocol for concurrency control. This is because EP requires that read locks are not released by a participant during its window of uncertainty; however, it is not possible for a locking protocol to provide this guarantee in a multilevel secure system (since the read lock of a higher-level transaction on a lower-level data object must be released whenever a lower-level transaction wants to write the same data). The only available work in the literature, namely the Secure Early Prepare protocol (SEP), overcomes this difficulty by aborting those distributed transactions that release their low-level read locks prematurely. We see this approach as being too restrictive. One of the major benefits of distributed processing is its robustness to failures, and SEP fails to take advantage of this. In this work, we propose the Advanced Secure Early Prepare commit protocol (ASEP) to solve the above problem together with a number of language primitives that can be used as system calls in distributed transactions. These primitives permit features like partial rollback and forward recovery to be incorporated within the transaction model, and allow a distributed transaction to proceed even when a participant has released its low-level read locks prematurely. This not only offers flexibility, but can also be used, if desired, by a sophisticated programmer to trade off consistency for atomicity of the distributed transaction.