Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Using semantic knowledge of transactions to increase concurrency
ACM Transactions on Database Systems (TODS)
Organizing long-running activities with triggers and transactions
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Set-oriented production rules in relational database systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Modeling long-running activities as nested sagas
Data Engineering
A denotational semantics for the Starburst production rule language
ACM SIGMOD Record
Formal aspects of concurrency control in long-duration transaction systems using the NT/PV model
ACM Transactions on Database Systems (TODS)
Building an Integrated Active OODBMS: Requirements, Architecture, and Design Decisions
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Split-Transactions for Open-Ended Activities
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Language Constructs for Programming Active Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Ode as an Active Database: Constraints and Triggers
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Transactional Model for Long-Running Activities
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Study of Distributed Real-Time Active Database Applications
A Study of Distributed Real-Time Active Database Applications
Graph Theory with Applications to Engineering and Computer Science (Prentice Hall Series in Automatic Computation)
Performance analysis of long-lived cooperative transactions in active DBMS
Data & Knowledge Engineering
| Hi-index | 0.00 |
Active object oriented database management systems (AODBMS) are finding increasing application in different application domains and especially for cooperative and long duration activity management. In this paper, we propose a concurrency control mechanism for open nested transactions in an AODBMS. It exploits the semantics of the transactions to achieve controlled cooperation and concurrency among the transactions. Atomic AODBMS transactions are treated as base transactions. A complex transaction type is formed from a collection of base and complex transactions, a set of detached mode ECA rules and a state transition model. The cooperation semantics of a complex transaction type with other complex transaction types is specified by associating with each state of a complex transaction, a set of cooperating complex transaction types. The abort semantics of a complex transaction type is specified by means of compensating base transactions. We define a correct class of schedule called CoopComp-schedule which satisfies the state transition semantics of the individual complex transactions and also maintains the cooperation and compensation semantics of the individual complex transactions within the generated schedule. A concurrency control scheme called NP-QuadLock for generating only CoopComp-schedules has been provided. The proof of correctness of the proposed concurrency control mechanism is also given.