|
|
|
@inproceedings{DBLP:conf/vldb/NodineZ90,
author = {Marian H. Nodine and
Stanley B. Zdonik},
editor = {Dennis McLeod and
Ron Sacks-Davis and
Hans-J{\"o}rg Schek},
title = {Cooperative Transaction Hierarchies: A Transaction Model to Support
Design Applications},
booktitle = {16th International Conference on Very Large Data Bases, August
13-16, 1990, Brisbane, Queensland, Australia, Proceedings},
publisher = {Morgan Kaufmann},
year = {1990},
isbn = {1-55860-149-X},
pages = {83-94},
ee = {db/conf/vldb/NodineZ90.html},
crossref = {DBLP:conf/vldb/90},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Traditional atomic and nested transactions are not always well-suited to cooperative applications. Cooperative applications place requirements on the database which may conflictwith the serializability requirement. We define a new transaction framework, called a cooperative transaction hierarchy, which allows us to relax the requirement for atomic, serializable transactions. Each internal node (transaction group) in the transaction hierarchy canenforce its own constraints on how objects can be shared among its children (members).
Patterns specify the constraints imposed on an operation history for itto be correct. At a given node in the hierarchy, we use a type of augmented finite state automaton called an operation machine to enforce correctness. We provide intentions to manage the propagation of object copies and their associated privileges through the transaction hierarchy. We show that using intentions enforces that the overall history of the hierarchy is correct.
Logs record the information required by the cooperative transaction hierarchy for recovery. We specify what must be logged for each transaction group, which includes information about the transaction group's execution and about the dependencies among operations in that execution. Finally, we show how to use cooperative transaction hierarchies to enforce multilevel atomicity [Lyn83].
Copyright © 1990 by the VLDB Endowment. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the VLDB copyright notice and the title of the publication and its date appear, and notice is given that copying is by the permission of the Very Large Data Base Endowment. To copy otherwise, or to republish, requires a fee and/or special permission from the Endowment.
