Files in this item
|(no description provided)|
|Title:||An architecture and transaction model for large federated databases|
|Doctoral Committee Chair(s):||Belford, Geneva G.|
|Department / Program:||Computer Science|
|Degree Granting Institution:||University of Illinois at Urbana-Champaign|
|Abstract:||Over the past 20 years much research has been done on developing architectures and transaction management algorithms for federated databases. These systems all use some variant of Two Phase Commit (2PC) protocol to ensure the correctness of federated transactions. A major problem with these schemes is that they do not scale well to systems with large numbers of component databases and/or very long-duration transactions due to the inherent limitations of the 2PC protocol with respect to site/communication failures; blocking/deadlock within component databases; and the length of time that locks are held. My research presents an architecture and transaction model that will robustly scale to federations with large numbers (e.g. thousands, tens of thousands, or more) of fully autonomous members. The transaction models I propose only require the federation members to support read and/or write; commit; and abort operations. As a consequence of this it will be necessary to relax some of the ACID (Atomicity, Consistency, Isolation, Durability) properties that conventional transactions exhibit.
These federated transactions will contain much semantic knowledge about applications and data. As such they should be thought of as intelligent entities that can be used as building blocks for bigger transactions and applications using active database techniques. This also has positive software engineering implications for my architecture since it should facilitate code reuse and improve reliability. These models also explicitly recognize and exploit the parallelism available within a federated transaction in order to minimize processing time. The architecture I propose is geared to accommodating non-traditional types of database applications that demand less rigorous notions of consistency and cannot be built using conventional database tools. A highly distributed and dynamically configurable type of architecture is presented along with a transaction programming language and toolkit designed to build robust applications.
|Rights Information:||Copyright 1996 Chazin, David|
|Date Available in IDEALS:||2011-05-07|
|Identifier in Online Catalog:||AAI9712221|