Using tickets to enforce the serializability of multidatabase transactions

DMCA

Using tickets to enforce the serializability of multidatabase transactions (1994)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Dimitrios Georgakopoulos , Marek Rusinkiewicz , Amit Sheth

Venue:	IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
Citations:	45 - 0 self

BibTeX

@ARTICLE{Georgakopoulos94usingtickets,
    author = {Dimitrios Georgakopoulos and Marek Rusinkiewicz and Amit Sheth},
    title = {Using tickets to enforce the serializability of multidatabase transactions},
    journal = {IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING},
    year = {1994},
    volume = {6}
}

OpenURL

Abstract

To enforce global serializability in a multidatabase environment themultidatabase transaction manager must take into account the indirect (transitive) conflicts between multidatabase transactions caused by local transactions. Such conflicts are difficult to resolve because the behavior or even the existence of local transactions is not known to the multidatabase system. To overcome these difficulties, we propose to incorporate additional data manipulation operations in the subtransactions of each multidatabase transaction. We show that if these operations create direct conflicts between subtransactions at each participating local database system, indirect conflicts can be resolved even if the multidatabase system is not aware of their existence. Based on this approach, we introduce optimistic and conservative multidatabase transaction management methods that require the local database systems to assure only local serializability. The proposed methods do not violate the autonomy of the local database systems and guarantee global serializability by preventing multidatabase transactions from being serialized in different ways at the participating database systems. Refinements of these methods are also proposed for multidatabase environments where the participating database systems allow schedules that are cascadeless or transactions have analogous execution and serialization orders. In particular, we show that forced local conflicts can be eliminated in rigorous local systems, local cascadelessness simplifies the design of a global scheduler and that local strictness offers no significant advantages over cascadelessness.

Keyphrases

multidatabase transaction local database system multidatabase system database system local transaction multidatabase environment themultidatabase transaction manager multidatabase environment local serializability local strictness global scheduler conservative multidatabase transaction management method different way rigorous local system local cascadelessness analogous execution indirect conflict serialization order direct conflict guarantee global serializability additional data manipulation operation local conflict global serializability significant advantage

DMCA