Transaction scheduling in dynamic composite multidatabase systems

  • Authors:
  • Dexter P. Bradshaw;Per-Åke Larson;Jacob Slonim

  • Affiliations:
  • Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1;Department of Computer Science, University of Waterloo, Waterloo, Ontario N2L 3G1;University of Waterloo

  • Venue:
  • CASCON '95 Proceedings of the 1995 conference of the Centre for Advanced Studies on Collaborative research
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper proposes composite multidatabase architecture consisting of multiple, possibly heterogeneous, peer multidatabase servers distributed on a communications network. The domain of each multidatabase server is treated as a multidatabase cell. Global transactions could span multiple multidatabase cells, sometimes forcing multidatabase servers to act as component database systems. Although each multidatabase server guarantees serializable execution histories for transactions under its control, concurrent global transactions spanning multiple multidatabase systems may lead to non-serializable global histories.Some multidatabase concurrency control algorithms guarantee global serializability during composition if all participating cells use them. However, composition should not be restricted by the homogeneity of the concurrency control in each cell. A generic algorithm that maintains global serializability during multidatabase composition through transaction ordering is proposed. This algorithm permits the mixing and matching of any set of global concurrency control algorithms during multidatabase composition while still guaranteeing global serializability.