Advertisement

Constraints

  • Jan Paredaens
  • Paul De Bra
  • Marc Gyssens
  • Dirk Van Gucht
Part of the EATCS Monographs on Theoretical Computer Science book series (EATCS, volume 17)

Abstract

As we saw in Chapter 1, we need to specify constraints in the description of a database in order to ensure that the instances we might obtain are meaningful. We distinguished relation constraints, database constraints, dynamic relation constraints and dynamic database constraints. In this chapter, we restrict ourselves to “static” relation constraints. Database constraints will not be discussed in detail; however we do urge the reader to convince himself that there exist database constraints which cannot be expressed by constraints on the relations contained in the database (see Exercise 1.8). Dynamic constraints will be discussed in Chapter 8. Section 3.1 is devoted to some general terminology concerning constraints. In Sections 3.2 till 3.6, we discuss some important types of relation constraints.

Keywords

Functional Dependency Axiom System Relation Scheme Integrity Check Relation Instance 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Jan Paredaens
    • 1
  • Paul De Bra
    • 1
  • Marc Gyssens
    • 1
  • Dirk Van Gucht
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversiteit AntwerpenAntwerpenBelgium
  2. 2.Computer Science DepartmentIndiana UniversityBloomingtonUSA

Personalised recommendations