Maintaining quasi serializability in multidatabase systems

Weimin Du*, Ahmed K. Elmagarmid, Won Kim

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Citations (Scopus)

Abstract

A scheduler producing quasi-serializable executions for concurrency control in multidatabase systems (MDBSs) is presented. An algorithm is proposed which ensures quasi-serializability by controlling submissions of global transactions. The algorithm groups global transactions in such a way that transactions in a group affect each other in a partial order. Transaction groups are executed separately and in a consistent order at all local sites. The algorithm differs from the others in that it does not violate local autonomy, provides a high degree of concurrency, and is globally deadlock-free.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
PublisherPubl by IEEE
Pages360-367
Number of pages8
ISBN (Print)0818621389
Publication statusPublished - Apr 1991
Externally publishedYes
EventProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
Duration: 8 Apr 199112 Apr 1991

Publication series

NameProceedings - International Conference on Data Engineering

Conference

ConferenceProceedings of the 7th International Conference on Data Engineering
CityKobe, Jpn
Period8/04/9112/04/91

Fingerprint

Dive into the research topics of 'Maintaining quasi serializability in multidatabase systems'. Together they form a unique fingerprint.

Cite this