Abstract
The correctness of nested transactions for multidatabases differs from that of flat transactions in that, for nested transactions the execution order of siblings at each related site should also be consistent. In this paper we first propose a simple but powerful theory for the serializability of nested transactions in multidatabases and then a technique called Nested Tickets Method for Nested Transactions (NTNT). The NTNT technique provides correctness of nested transactions in multidatabases without violating the local autonomy of the participating DB-MSs. The algorithm is fully distributed, in other words there is no central scheduler. The correctness of the NTNT technique is proved by using the developed theory.
Cite
CITATION STYLE
Halici, U., Arpinar, B., & Dogac, A. (1997). Serializability of nested transactions in multidatabases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1186, pp. 321–335). Springer Verlag. https://doi.org/10.1007/3-540-62222-5_54
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
