Overcoming Heterogeneity and Autonomy in Multidatabase Systems

A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that sp...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information and computation 2001-06, Vol.167 (2), p.132-172
Hauptverfasser: Mehrotra, Sharad, Rastogi, Rajeev, Breitbart, Yuri, Korth, Henry F, Silberschatz, Abraham
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 172
container_issue 2
container_start_page 132
container_title Information and computation
container_volume 167
creator Mehrotra, Sharad
Rastogi, Rajeev
Breitbart, Yuri
Korth, Henry F
Silberschatz, Abraham
description A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that span multiple local DBMSs without jeopardizing database consistency. The difficulty in transaction management in MDBSs arises due to the heterogeneity of the transaction management algorithms used by the local DBMSs, and the desire to preserve their local autonomy. In this paper, we develop a framework for designing fault-tolerant transaction management algorithms for MDBS environments that effectively overcomes the heterogeneity- and autonomy-induced problems. The developed framework builds on our previous work. It uses the approach described in S. Mehrotra et al. (1992, in “Proceedings of ACM–SIGMOD 1992 International Conference on Management of Data, San Diego, CA”) to overcome the problems in ensuring serializability that arise due to heterogeneity of the local concurrency control protocols. Furthermore, it uses a redo approach to recovery for ensuring transaction atomicity (Y. Breitbart et al., 1990, in “Proceedings of ACM–SIGMOD 1990 International Conference on Management of Data, Atlantic City, NJ;” Mehrotra et al., 1992, in “Proceedings of the Eleventh ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems, San Diego, CA;” and A. Wolski and J. Veijalainen, 1990, in “Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications”, pp. 321–330), that strives to ensure atomicity of transactions without the usage of the 2PC protocol. We reduce the task of ensuring serializability in MDBSs in the presence of failures to solving three independent subproblems, solutions to which together constitute a complete strategy for failure-resilient transaction management in MDBS environments. We develop mechanisms with which each of the three subproblems can be solved without requiring any changes be made to the preexisting software of the local DBMSs and without compromising their autonomy.
doi_str_mv 10.1006/inco.2001.3033
format Article
fullrecord <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1006_inco_2001_3033</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0890540101930330</els_id><sourcerecordid>S0890540101930330</sourcerecordid><originalsourceid>FETCH-LOGICAL-c355t-fca28ed7eaef0af5685e87e93ade8e574137065fc7d04f067999fd1355b95a3b3</originalsourceid><addsrcrecordid>eNp1kDFPwzAQRi0EEqWwMmdgTTjHcZwsSFUFFKmoAzBbrn2ujBqnst1K-fckKhIT093wvbt7R8g9hYIC1I_O674oAWjBgLELMqPQQl7WnF6SGTRjzyug1-Qmxu8xRXlVz8jT5oRB953zu2yFCUO_Q48uDZnyJlscU-_7bsicz96P--SMSmqrImYfQ0zYxVtyZdU-4t1vnZOvl-fP5Spfb17flot1rhnnKbdalQ0agQotKMvrhmMjsGXKYINcVJQJqLnVwkBloRZt21pDR3bbcsW2bE6K81wd-hgDWnkIrlNhkBTkZC8neznZy8l-BB7OwEFFrfY2KK9d_KPG31RcjLHmHMPx-JPDIKN26DUaF1AnaXr334YfqOtuXQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Overcoming Heterogeneity and Autonomy in Multidatabase Systems</title><source>Elsevier ScienceDirect Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Mehrotra, Sharad ; Rastogi, Rajeev ; Breitbart, Yuri ; Korth, Henry F ; Silberschatz, Abraham</creator><creatorcontrib>Mehrotra, Sharad ; Rastogi, Rajeev ; Breitbart, Yuri ; Korth, Henry F ; Silberschatz, Abraham</creatorcontrib><description>A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that span multiple local DBMSs without jeopardizing database consistency. The difficulty in transaction management in MDBSs arises due to the heterogeneity of the transaction management algorithms used by the local DBMSs, and the desire to preserve their local autonomy. In this paper, we develop a framework for designing fault-tolerant transaction management algorithms for MDBS environments that effectively overcomes the heterogeneity- and autonomy-induced problems. The developed framework builds on our previous work. It uses the approach described in S. Mehrotra et al. (1992, in “Proceedings of ACM–SIGMOD 1992 International Conference on Management of Data, San Diego, CA”) to overcome the problems in ensuring serializability that arise due to heterogeneity of the local concurrency control protocols. Furthermore, it uses a redo approach to recovery for ensuring transaction atomicity (Y. Breitbart et al., 1990, in “Proceedings of ACM–SIGMOD 1990 International Conference on Management of Data, Atlantic City, NJ;” Mehrotra et al., 1992, in “Proceedings of the Eleventh ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems, San Diego, CA;” and A. Wolski and J. Veijalainen, 1990, in “Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications”, pp. 321–330), that strives to ensure atomicity of transactions without the usage of the 2PC protocol. We reduce the task of ensuring serializability in MDBSs in the presence of failures to solving three independent subproblems, solutions to which together constitute a complete strategy for failure-resilient transaction management in MDBS environments. We develop mechanisms with which each of the three subproblems can be solved without requiring any changes be made to the preexisting software of the local DBMSs and without compromising their autonomy.</description><identifier>ISSN: 0890-5401</identifier><identifier>EISSN: 1090-2651</identifier><identifier>DOI: 10.1006/inco.2001.3033</identifier><identifier>CODEN: INFCEC</identifier><language>eng</language><publisher>San Diego, CA: Elsevier Inc</publisher><subject>Applied sciences ; Computer science; control theory; systems ; Data processing. List processing. Character string processing ; Exact sciences and technology ; Memory organisation. Data processing ; Software</subject><ispartof>Information and computation, 2001-06, Vol.167 (2), p.132-172</ispartof><rights>2001 Academic Press</rights><rights>2001 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c355t-fca28ed7eaef0af5685e87e93ade8e574137065fc7d04f067999fd1355b95a3b3</citedby><cites>FETCH-LOGICAL-c355t-fca28ed7eaef0af5685e87e93ade8e574137065fc7d04f067999fd1355b95a3b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1006/inco.2001.3033$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,776,780,3536,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=1109457$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Mehrotra, Sharad</creatorcontrib><creatorcontrib>Rastogi, Rajeev</creatorcontrib><creatorcontrib>Breitbart, Yuri</creatorcontrib><creatorcontrib>Korth, Henry F</creatorcontrib><creatorcontrib>Silberschatz, Abraham</creatorcontrib><title>Overcoming Heterogeneity and Autonomy in Multidatabase Systems</title><title>Information and computation</title><description>A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that span multiple local DBMSs without jeopardizing database consistency. The difficulty in transaction management in MDBSs arises due to the heterogeneity of the transaction management algorithms used by the local DBMSs, and the desire to preserve their local autonomy. In this paper, we develop a framework for designing fault-tolerant transaction management algorithms for MDBS environments that effectively overcomes the heterogeneity- and autonomy-induced problems. The developed framework builds on our previous work. It uses the approach described in S. Mehrotra et al. (1992, in “Proceedings of ACM–SIGMOD 1992 International Conference on Management of Data, San Diego, CA”) to overcome the problems in ensuring serializability that arise due to heterogeneity of the local concurrency control protocols. Furthermore, it uses a redo approach to recovery for ensuring transaction atomicity (Y. Breitbart et al., 1990, in “Proceedings of ACM–SIGMOD 1990 International Conference on Management of Data, Atlantic City, NJ;” Mehrotra et al., 1992, in “Proceedings of the Eleventh ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems, San Diego, CA;” and A. Wolski and J. Veijalainen, 1990, in “Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications”, pp. 321–330), that strives to ensure atomicity of transactions without the usage of the 2PC protocol. We reduce the task of ensuring serializability in MDBSs in the presence of failures to solving three independent subproblems, solutions to which together constitute a complete strategy for failure-resilient transaction management in MDBS environments. We develop mechanisms with which each of the three subproblems can be solved without requiring any changes be made to the preexisting software of the local DBMSs and without compromising their autonomy.</description><subject>Applied sciences</subject><subject>Computer science; control theory; systems</subject><subject>Data processing. List processing. Character string processing</subject><subject>Exact sciences and technology</subject><subject>Memory organisation. Data processing</subject><subject>Software</subject><issn>0890-5401</issn><issn>1090-2651</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><recordid>eNp1kDFPwzAQRi0EEqWwMmdgTTjHcZwsSFUFFKmoAzBbrn2ujBqnst1K-fckKhIT093wvbt7R8g9hYIC1I_O674oAWjBgLELMqPQQl7WnF6SGTRjzyug1-Qmxu8xRXlVz8jT5oRB953zu2yFCUO_Q48uDZnyJlscU-_7bsicz96P--SMSmqrImYfQ0zYxVtyZdU-4t1vnZOvl-fP5Spfb17flot1rhnnKbdalQ0agQotKMvrhmMjsGXKYINcVJQJqLnVwkBloRZt21pDR3bbcsW2bE6K81wd-hgDWnkIrlNhkBTkZC8neznZy8l-BB7OwEFFrfY2KK9d_KPG31RcjLHmHMPx-JPDIKN26DUaF1AnaXr334YfqOtuXQ</recordid><startdate>20010615</startdate><enddate>20010615</enddate><creator>Mehrotra, Sharad</creator><creator>Rastogi, Rajeev</creator><creator>Breitbart, Yuri</creator><creator>Korth, Henry F</creator><creator>Silberschatz, Abraham</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>6I.</scope><scope>AAFTH</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20010615</creationdate><title>Overcoming Heterogeneity and Autonomy in Multidatabase Systems</title><author>Mehrotra, Sharad ; Rastogi, Rajeev ; Breitbart, Yuri ; Korth, Henry F ; Silberschatz, Abraham</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c355t-fca28ed7eaef0af5685e87e93ade8e574137065fc7d04f067999fd1355b95a3b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Applied sciences</topic><topic>Computer science; control theory; systems</topic><topic>Data processing. List processing. Character string processing</topic><topic>Exact sciences and technology</topic><topic>Memory organisation. Data processing</topic><topic>Software</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mehrotra, Sharad</creatorcontrib><creatorcontrib>Rastogi, Rajeev</creatorcontrib><creatorcontrib>Breitbart, Yuri</creatorcontrib><creatorcontrib>Korth, Henry F</creatorcontrib><creatorcontrib>Silberschatz, Abraham</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>Pascal-Francis</collection><collection>CrossRef</collection><jtitle>Information and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mehrotra, Sharad</au><au>Rastogi, Rajeev</au><au>Breitbart, Yuri</au><au>Korth, Henry F</au><au>Silberschatz, Abraham</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Overcoming Heterogeneity and Autonomy in Multidatabase Systems</atitle><jtitle>Information and computation</jtitle><date>2001-06-15</date><risdate>2001</risdate><volume>167</volume><issue>2</issue><spage>132</spage><epage>172</epage><pages>132-172</pages><issn>0890-5401</issn><eissn>1090-2651</eissn><coden>INFCEC</coden><abstract>A multidatabase system (MDBS) is a software system for integration of preexisting and independent local database management systems (DBMSs). The transaction management problem in MDBSs consists of designing appropriate software, on top of local DBMSs, such that users can execute transactions that span multiple local DBMSs without jeopardizing database consistency. The difficulty in transaction management in MDBSs arises due to the heterogeneity of the transaction management algorithms used by the local DBMSs, and the desire to preserve their local autonomy. In this paper, we develop a framework for designing fault-tolerant transaction management algorithms for MDBS environments that effectively overcomes the heterogeneity- and autonomy-induced problems. The developed framework builds on our previous work. It uses the approach described in S. Mehrotra et al. (1992, in “Proceedings of ACM–SIGMOD 1992 International Conference on Management of Data, San Diego, CA”) to overcome the problems in ensuring serializability that arise due to heterogeneity of the local concurrency control protocols. Furthermore, it uses a redo approach to recovery for ensuring transaction atomicity (Y. Breitbart et al., 1990, in “Proceedings of ACM–SIGMOD 1990 International Conference on Management of Data, Atlantic City, NJ;” Mehrotra et al., 1992, in “Proceedings of the Eleventh ACM SIGACT–SIGMOD–SIGART Symposium on Principles of Database Systems, San Diego, CA;” and A. Wolski and J. Veijalainen, 1990, in “Proceedings of the International Conference on Databases, Parallel Architectures and Their Applications”, pp. 321–330), that strives to ensure atomicity of transactions without the usage of the 2PC protocol. We reduce the task of ensuring serializability in MDBSs in the presence of failures to solving three independent subproblems, solutions to which together constitute a complete strategy for failure-resilient transaction management in MDBS environments. We develop mechanisms with which each of the three subproblems can be solved without requiring any changes be made to the preexisting software of the local DBMSs and without compromising their autonomy.</abstract><cop>San Diego, CA</cop><pub>Elsevier Inc</pub><doi>10.1006/inco.2001.3033</doi><tpages>41</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0890-5401
ispartof Information and computation, 2001-06, Vol.167 (2), p.132-172
issn 0890-5401
1090-2651
language eng
recordid cdi_crossref_primary_10_1006_inco_2001_3033
source Elsevier ScienceDirect Journals; EZB-FREE-00999 freely available EZB journals
subjects Applied sciences
Computer science
control theory
systems
Data processing. List processing. Character string processing
Exact sciences and technology
Memory organisation. Data processing
Software
title Overcoming Heterogeneity and Autonomy in Multidatabase Systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T12%3A42%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Overcoming%20Heterogeneity%20and%20Autonomy%20in%20Multidatabase%20Systems&rft.jtitle=Information%20and%20computation&rft.au=Mehrotra,%20Sharad&rft.date=2001-06-15&rft.volume=167&rft.issue=2&rft.spage=132&rft.epage=172&rft.pages=132-172&rft.issn=0890-5401&rft.eissn=1090-2651&rft.coden=INFCEC&rft_id=info:doi/10.1006/inco.2001.3033&rft_dat=%3Celsevier_cross%3ES0890540101930330%3C/elsevier_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0890540101930330&rfr_iscdi=true