Composite multidatabase system concurrency control and recovery

  • Authors:
  • Dexter P. Bradshaw

  • Affiliations:
  • University of Waterloo, Waterloo, Ontario

  • Venue:
  • CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2
  • Year:
  • 1993

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multidatabase systems based on single monolithic multidatabase servers are not realistic and do not scale with increases in the number of participant component database systems and the radius of service. In this paper, we focus on an architecture in which the multidatabase system consists of multiple, possibly heterogeneous peer servers distributed on a communication network. A global multidatabase request can span multiple servers, causing some servers to act as component database systems. We refer to this configuration as a composite multidatabase system.We examine the effect of multidatabase composition on global concurrency control algorithms proposed for single server systems. Our examination is simplified by assuming a homogeneous composite multidatabase system; that is, multiple instances of the same multidatabase server managing disjoint sets of component database systems. In particular, we look at two global concurrency control algaorithms for guaranteeing multidatabase serializability: site locking and forced conflicts. We propose a design for the composite counterparts of these algorithms to show that the task of adapting existing global concurrency control algorithms to composite multidatabase systems is non-trivial.