Maintaining quasi serializability in multidatabase systems

Weimin Du, Ahmed Elmagarmid, Won Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 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
Place of PublicationPiscataway, NJ, United States
PublisherPubl by IEEE
Pages360-367
Number of pages8
ISBN (Print)0818621389
Publication statusPublished - 1 Apr 1991
Externally publishedYes
EventProceedings of the 7th International Conference on Data Engineering - Kobe, Jpn
Duration: 8 Apr 199112 Apr 1991

Other

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

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Du, W., Elmagarmid, A., & Kim, W. (1991). Maintaining quasi serializability in multidatabase systems. In Proceedings - International Conference on Data Engineering (pp. 360-367). Publ by IEEE.