Nested transactions: an approach to reliable distributed computing
Nested transactions: an approach to reliable distributed computing
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
A guide to the SQL standard
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A model for concurrency in nested transactions systems
Journal of the ACM (JACM)
A formal approach to recovery by compensating transactions
Proceedings of the sixteenth international conference on Very large databases
Concepts and applications of multilevel transactions and open nested transactions
Database transaction models for advanced applications
An overview of transaction logic
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Principles of transaction processing: for the systems professional
Principles of transaction processing: for the systems professional
Unifying concurrency control and recovery of transactions with semantically rich operations
Theoretical Computer Science - Special issue: database theory
Programming with Logical Queries, Bulk Updates, and Hypothetical Reasoning
IEEE Transactions on Knowledge and Data Engineering
Transactions and Updates in Deductive Databases
IEEE Transactions on Knowledge and Data Engineering
Logical Transactions and Serializability
ILPS '97 International Seminar on Logic Databases and the Meaning of Change, Transactions and Change in Logic Databases
Design for Change: Evolving Workflow Specifications in ULTRAflow
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
The rule-based update language ULTRA has been designed for the specification of complex database updates in a modular fashion. The logical semantics of update goals is based on update request sets, which correspond to deferred basic updates in the database. The declarative character of the logical semantics leaves much freedom for various evaluation strategies, among them a top-down resolution, which can be mapped naturally onto a system of nested transactions. In this paper, we extend this operational model as follows: Not only the basic operations are performed and committed independently from the top-level transaction, but also complex operations defined by update rules. This leads to an open nested transaction hierarchy, which allows to exploit the semantical properties of complex operations to gain more concurrency. On the other hand, high-level compensation is necessary and meta information must be provided by the programmer. We present the key elements of this combination of logic-based update languages and transaction processing and propose a flexible system architecture.