Concurrency control in federated databases

A dynamic approach

San Yih Hwang, Jiandong Huang, Jaideep Srivastava

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

1 Citation (Scopus)

Abstract

The concurrency control problem in a federated database system (FDBS) is especially difficult due to the inherent heterogeneity and autonomy of participating local database systems. A number of FDBS concurrency control algorithms have been proposed. However, each algorithm has the drawbacks of low concurrency, global deadlocks or high system resource wastage. In this paper we propose a new protocol, called Dynamic Adjustment of Global Serialization Order (DAGSO), which provides high concurrency and is able to reduce system resource wastage due to early detection and abortion of eventually non-globally serializable transactions. The protocol is proved to be correct for achieving global serializability and free from global deadlocks. This paper also compares, using a detailed simulation model, the global transaction throughput of DAGSO with Top Down, Bottom Up, and Site Graph approaches proposed in the literature. The results show that DAGSO performs the best in most local system operating regions and range of global transaction behavior.

Original languageEnglish
Title of host publicationProc 2 Int Conf Inf Knowl Manage
EditorsBharat Bhargava, Timothy Finin, Yelena Yesha
Place of PublicationNew York, NY, United States
PublisherPubl by ACM
Pages694-703
Number of pages10
ISBN (Print)0897916263
Publication statusPublished - 1993
Externally publishedYes
EventProceedings of the 2nd International Conference on Information and Knowledge Management - Washington, DC, USA
Duration: 1 Nov 19935 Nov 1993

Other

OtherProceedings of the 2nd International Conference on Information and Knowledge Management
CityWashington, DC, USA
Period1/11/935/11/93

Fingerprint

Concurrency control
Network protocols
Throughput

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Hwang, S. Y., Huang, J., & Srivastava, J. (1993). Concurrency control in federated databases: A dynamic approach. In B. Bhargava, T. Finin, & Y. Yesha (Eds.), Proc 2 Int Conf Inf Knowl Manage (pp. 694-703). New York, NY, United States: Publ by ACM.

Concurrency control in federated databases : A dynamic approach. / Hwang, San Yih; Huang, Jiandong; Srivastava, Jaideep.

Proc 2 Int Conf Inf Knowl Manage. ed. / Bharat Bhargava; Timothy Finin; Yelena Yesha. New York, NY, United States : Publ by ACM, 1993. p. 694-703.

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

Hwang, SY, Huang, J & Srivastava, J 1993, Concurrency control in federated databases: A dynamic approach. in B Bhargava, T Finin & Y Yesha (eds), Proc 2 Int Conf Inf Knowl Manage. Publ by ACM, New York, NY, United States, pp. 694-703, Proceedings of the 2nd International Conference on Information and Knowledge Management, Washington, DC, USA, 1/11/93.
Hwang SY, Huang J, Srivastava J. Concurrency control in federated databases: A dynamic approach. In Bhargava B, Finin T, Yesha Y, editors, Proc 2 Int Conf Inf Knowl Manage. New York, NY, United States: Publ by ACM. 1993. p. 694-703
Hwang, San Yih ; Huang, Jiandong ; Srivastava, Jaideep. / Concurrency control in federated databases : A dynamic approach. Proc 2 Int Conf Inf Knowl Manage. editor / Bharat Bhargava ; Timothy Finin ; Yelena Yesha. New York, NY, United States : Publ by ACM, 1993. pp. 694-703
@inproceedings{9d2f9e9c8c5b41678d7fa3738b9fe8ee,
title = "Concurrency control in federated databases: A dynamic approach",
abstract = "The concurrency control problem in a federated database system (FDBS) is especially difficult due to the inherent heterogeneity and autonomy of participating local database systems. A number of FDBS concurrency control algorithms have been proposed. However, each algorithm has the drawbacks of low concurrency, global deadlocks or high system resource wastage. In this paper we propose a new protocol, called Dynamic Adjustment of Global Serialization Order (DAGSO), which provides high concurrency and is able to reduce system resource wastage due to early detection and abortion of eventually non-globally serializable transactions. The protocol is proved to be correct for achieving global serializability and free from global deadlocks. This paper also compares, using a detailed simulation model, the global transaction throughput of DAGSO with Top Down, Bottom Up, and Site Graph approaches proposed in the literature. The results show that DAGSO performs the best in most local system operating regions and range of global transaction behavior.",
author = "Hwang, {San Yih} and Jiandong Huang and Jaideep Srivastava",
year = "1993",
language = "English",
isbn = "0897916263",
pages = "694--703",
editor = "Bharat Bhargava and Timothy Finin and Yelena Yesha",
booktitle = "Proc 2 Int Conf Inf Knowl Manage",
publisher = "Publ by ACM",

}

TY - GEN

T1 - Concurrency control in federated databases

T2 - A dynamic approach

AU - Hwang, San Yih

AU - Huang, Jiandong

AU - Srivastava, Jaideep

PY - 1993

Y1 - 1993

N2 - The concurrency control problem in a federated database system (FDBS) is especially difficult due to the inherent heterogeneity and autonomy of participating local database systems. A number of FDBS concurrency control algorithms have been proposed. However, each algorithm has the drawbacks of low concurrency, global deadlocks or high system resource wastage. In this paper we propose a new protocol, called Dynamic Adjustment of Global Serialization Order (DAGSO), which provides high concurrency and is able to reduce system resource wastage due to early detection and abortion of eventually non-globally serializable transactions. The protocol is proved to be correct for achieving global serializability and free from global deadlocks. This paper also compares, using a detailed simulation model, the global transaction throughput of DAGSO with Top Down, Bottom Up, and Site Graph approaches proposed in the literature. The results show that DAGSO performs the best in most local system operating regions and range of global transaction behavior.

AB - The concurrency control problem in a federated database system (FDBS) is especially difficult due to the inherent heterogeneity and autonomy of participating local database systems. A number of FDBS concurrency control algorithms have been proposed. However, each algorithm has the drawbacks of low concurrency, global deadlocks or high system resource wastage. In this paper we propose a new protocol, called Dynamic Adjustment of Global Serialization Order (DAGSO), which provides high concurrency and is able to reduce system resource wastage due to early detection and abortion of eventually non-globally serializable transactions. The protocol is proved to be correct for achieving global serializability and free from global deadlocks. This paper also compares, using a detailed simulation model, the global transaction throughput of DAGSO with Top Down, Bottom Up, and Site Graph approaches proposed in the literature. The results show that DAGSO performs the best in most local system operating regions and range of global transaction behavior.

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

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

M3 - Conference contribution

SN - 0897916263

SP - 694

EP - 703

BT - Proc 2 Int Conf Inf Knowl Manage

A2 - Bhargava, Bharat

A2 - Finin, Timothy

A2 - Yesha, Yelena

PB - Publ by ACM

CY - New York, NY, United States

ER -