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

Concurrency control

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). Piscataway, NJ, United States: Publ by IEEE.

Maintaining quasi serializability in multidatabase systems. / Du, Weimin; Elmagarmid, Ahmed; Kim, Won.

Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. p. 360-367.

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

Du, W, Elmagarmid, A & Kim, W 1991, Maintaining quasi serializability in multidatabase systems. in Proceedings - International Conference on Data Engineering. Publ by IEEE, Piscataway, NJ, United States, pp. 360-367, Proceedings of the 7th International Conference on Data Engineering, Kobe, Jpn, 8/4/91.
Du W, Elmagarmid A, Kim W. Maintaining quasi serializability in multidatabase systems. In Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States: Publ by IEEE. 1991. p. 360-367
Du, Weimin ; Elmagarmid, Ahmed ; Kim, Won. / Maintaining quasi serializability in multidatabase systems. Proceedings - International Conference on Data Engineering. Piscataway, NJ, United States : Publ by IEEE, 1991. pp. 360-367
@inproceedings{8fb18edad54848b2b222ca50d09582ba,
title = "Maintaining quasi serializability in multidatabase systems",
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.",
author = "Weimin Du and Ahmed Elmagarmid and Won Kim",
year = "1991",
month = "4",
day = "1",
language = "English",
isbn = "0818621389",
pages = "360--367",
booktitle = "Proceedings - International Conference on Data Engineering",
publisher = "Publ by IEEE",

}

TY - GEN

T1 - Maintaining quasi serializability in multidatabase systems

AU - Du, Weimin

AU - Elmagarmid, Ahmed

AU - Kim, Won

PY - 1991/4/1

Y1 - 1991/4/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0026138625&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026138625&partnerID=8YFLogxK

M3 - Conference contribution

SN - 0818621389

SP - 360

EP - 367

BT - Proceedings - International Conference on Data Engineering

PB - Publ by IEEE

CY - Piscataway, NJ, United States

ER -