Protocols for Integrity Constraint Checking in FederatedDatabases

  • Authors:
  • Paul Grefen;Jennifer Widom

  • Affiliations:
  • Dept. of Computer Science, University of Twente, 7500 AE Enschede, The Netherlands. E-mail: grefen@cs.utwente.nl;Dept. of Computer Science, Stanford University, Stanford, CA 94305, USA. E-mail: widom@cs.stanford.edu

  • Venue:
  • Distributed and Parallel Databases
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

A federated database is comprised of multiple interconnecteddatabase systems that primarily operate independently but cooperate to acertain extent. Global integrity constraints can be very useful in federateddatabases, but the lack of global queries, global transaction mechanisms,and global concurrency control renders traditional constraint managementtechniques inapplicable. This paper presents a threefold contribution tointegrity constraint checking in federated databases: (1) The problem ofconstraint checking in a federated database environment is clearlyformulated. (2) A family of protocols for constraint checking is presented.(3) The differences across protocols in the family are analyzed with respectto system requirements, properties guaranteed by the protocols, andprocessing and communication costs. Thus, our work yields a suite of optionsfrom which a protocol can be chosen to suit the system capabilities andintegrity requirements of a particular federated database environment.