2PC Agent method: achieving serializability in presence of failures in a heterogeneous multidatabase

Wolski, Antoni; Veijalainen, Jari

doi:10.1109/parbse.1990.77157

Cited by 60 publications

(23 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many FDBS recovery algorithms have been proposed in the literature [4,25,20,1,12,24,26,6]. Due to space limitation, in this section we describe three of the prominent recovery algorithms in detail.…”

Section: Related Workmentioning

confidence: 99%

“…A number of FDBS transaction management algorithms have been proposed for a failure-free environment [21,9,16,3,13,18]. Recently, researchers have addressed the issue of transaction management in a failure-prone environment and a number of proposal have been made [4,25,1,12,24,20,7,26]. Each proposed recovery algorithm imposes some restrictions, which affect different aspects of local autonomy.…”

Section: Introductionmentioning

confidence: 99%

“…• partitioning the data in each local database into two exclusive sets that are updatable by local users and global users respectively, and limiting the global users from reading the local updatable data [4,25,6,26].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Transaction recovery in federated autonomous databases

Hwang

Srivastava

1994

Distrib Parallel Databases

View full text Add to dashboard Cite

Abstract. Transaction management for federated database systems (FDBSs), where each participating DBMS is autonomous, supports global transactions that can access more than one database. A number of concurrency control algorithms exist for the failure-free environment. Handling transaction failure, due to concurrency control or site related reasons, becomes especially difficult in the presence of autonomy. Due to local autonomy, carrying out 2-phase commit may not be possible. This can be simulated by providing a server on top of the pre-existing DBMS at each site, which is responsible for submitting the local operations to the associated DBMS and communicating with the transaction's originating site. In this paper we formalize the problem of ensuring transaction consistency in an FDBS environment in the presence of failure. The key problem is that due to autonomy, the local DBMS and FDBS may have different views of an execution sequence generated at a site. Local recoverability is identified as the property of local execution sequences necessary for correctness. The other main problem is of guaranteeing that the various locally recoverable histories are consistent with each other. These identified properties are necessary and sufficient conditions for the correctness of FDBS recovery algorithms, and can be used to evaluate the correctness of the proposed algorithms. This paper also presents an FDBS recovery algorithm that has been proved to be correct. Formal proofs of all properties and a comparison of different algorithms are provided.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Transaction recovery in federated autonomous databases

Hwang

Srivastava

1994

Distrib Parallel Databases

View full text Add to dashboard Cite

show abstract

“…In [4] it is proposed to divide the data items into globallyupdatable items and locally-updatable ones; moreover, transactions modifying globally-updatable data items wofild not be allowed to read locally-updatable items. A similar solution is used by [20] in their 2PC Agent Method method. The drawback of this kind of approaches is that they restrict access to the objects in the databases.…”

Section: Non-externalized Commit Databasesmentioning

confidence: 99%

Commit protocols for externalized-commit heterogeneous database systems

Tal

Alonso

1994

Distrib Parallel Databases

View full text Add to dashboard Cite

Abstract. In designing a heterogeneous database systems, one of the main technical challenges is developing techniques for ensuring global commit. That is, guaranteeing that a transaction spanning multiple individual database management systems (DBMSs) either commits at all the participating DBMSs or at none of them. Previous work in this area typically assumes that the participating DBMSs do not provide a mechanism for interacting with their commit facilities. While this is true in many cases, in practice there are systems which support a programmatic interface to their commit protocols. We refer to database systems offering such facilities as externalized commit DBMSs.The focus of this paper is on commit protocols for these systems. We propose two new commit protocols for externalized commit DBMSs. The first may be used to obtain global commit in heterogeneous database systems composed of DBMSs with different 2-phase commit protocols (e.g., centralized and linear). The second protocol is more general, and ensures global commit even if the participating DBMSs employ 3-phase commit protocols. The more general protocol also preserves database autonomy, since it does not block a DBMS upon failure of another system. We describe both protocols in detail and prove their correctness.

show abstract

“…Wolsld and Viejalainen have also undertaken research in this area and use a different approach than the others mentioned above [20]. Their research addresses issues of multidatabase architecture, concurrency control, and recovery.…”

Section: Modificationmentioning

confidence: 99%

Quantification of autonomy on multidatabase systems

Barker

1994

Journal of Systems Integration

View full text Add to dashboard Cite

Abstract. A multidatabase system is an interconnected collection of autonomous databases each managed by an autonomous database management system (DBMS). When integrating multiple DBMSs, the key is the autonomy of the underlying participants. Much research has been undertaken in the past five years aimed at describing and building an integrated multidatabase system, but to date the term autonomy has only been defined intuitively. This article provides a rigorous definition for autonomy tailored to the multidatabase environment specifically but applicable to any system environment that involves the collaboration of autonomous participants. The major contribution of this article is a technique that measures autonomy along multiple dimensions so a single numeric value describing the amount of autonomy violated by a particular system design is quantified. This has a two-fold implication. First, the technique described forces researchers to consider autonomy from several different aspects that may not be the central focus of their research, but must be considered because assumptions made regarding one aspect of a system may have implications in other areas. Second, the value can be used as a measure for direct comparison among different systems or proposals. Finally, the article demonstrates the quantification technique's applicability by applying it to several recent multidatabase research efforts.

show abstract

2PC Agent method: achieving serializability in presence of failures in a heterogeneous multidatabase

Cited by 60 publications

References 15 publications

Transaction recovery in federated autonomous databases

Transaction recovery in federated autonomous databases

Commit protocols for externalized-commit heterogeneous database systems

Quantification of autonomy on multidatabase systems

Contact Info

Product

Resources

About