Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
On rigorous Transaction Scheduling
IEEE Transactions on Software Engineering
Database transaction models for advanced applications
Database transaction models for advanced applications
Unifying concurrency control and recovery of transactions
Information Systems - Special issue on extending database technology
Ensuring relaxed atomicity for flexible transactions in multidatabase systems
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Unifying concurrency control and recovery of transactions with semantically rich operations
Theoretical Computer Science - Special issue: database theory
Adept_flex—Supporting Dynamic Changes of Workflows Without Losing Control
Journal of Intelligent Information Systems - Special issue on workflow management systems
Locks with constrained sharing (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrency control and recovery in transactional process management
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
The Recovery Manager of the System R Database Manager
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
A Transactional Nested Process Management System
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Altruistic Locking: A Strategy for Coping with Long Lived Transactions
Proceedings of the 2nd International Workshop on High Performance Transaction Systems
Distributed Processing over Stand-alone Systems and Applications
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
WISE: Business to Business E-Commerce
RIDE '99 Proceedings of the Ninth International Workshop on Research Issues on Data Engineering: Information Technology for Virtual Enterprises
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 1 - Volume 1
Automatic Generation of Reliable E-Commerce Payment Processes
WISE '00 Proceedings of the First International Conference on Web Information Systems Engineering (WISE'00)-Volume 1 - Volume 1
Atomicity and isolation for transactional processes
ACM Transactions on Database Systems (TODS)
Supporting Reliable Transactional Business Processes by Publish/Subscribe Techniques
TES '01 Proceedings of the Second International Workshop on Technologies for E-Services
Extending invalid-access prevention policy protocols for mobile-client data caching
Proceedings of the 2004 ACM symposium on Applied computing
Scheduling optimization in coupling independent services as a Grid transaction
Journal of Parallel and Distributed Computing
The Hyperdatabase Project --- From the Vision to Realizations
BNCOD '08 Proceedings of the 25th British national conference on Databases: Sharing Data, Information and Knowledge
Agents and Databases: A Symbiosis?
CIA '08 Proceedings of the 12th international workshop on Cooperative Information Agents XII
Ensuring serializability for mobile data mining on multimedia objects
CASDMKM'04 Proceedings of the 2004 Chinese academy of sciences conference on Data Mining and Knowledge Management
| Hi-index | 0.00 |
In this paper, we propose process locking, a dynamic scheduling protocol based on ideas of ordered shared locks, that allows for the correct concurrent and fault-tolerant execution of transactional processes. Transactional processes are well defined, complex structured collections of transactional services. The process structure comprises flow of control between single process steps and also considers alternatives for failure handling purposes. Moreover, the individual steps of a process may have different termination characteristics, i.e., they cannot be compensated once they have committed. All these constraints have to be taken into consideration when deciding how to interleave processes. However, due to the higher level semantics of processes, standard locking techniques based on shared and exclusive locks on data objects cannot be applied. Yet, process locking addresses both atomicity and isolation simultaneously at the appropriate level, the scheduling of processes, and accounts for the various constraints imposed by processes. In addition, process locking aims at providing a high degree of concurrency while, at the same time, minimizing execution costs. This is done by allowing cascading aborts for rather simple processes white this is prevented for complex, long-running processes within the same framework.