Technical reports

Constraints in CODD

M. Robson

18 pages

DOI: 10.48456/tr-22

Abstract

The paper describes the implementation of the data structuring concepts of domains, intra-tuple constraints and referential constraints in the relational DBMS CODD. All of these constraints capture some of the semantics of the database’s application.

Each class of constraint is described briefly and it is shown how each of them is specified. The constraints are stored in the database giving a centralised data model, which contains descriptions of procedures as well as of statistic structures. Some extensions to the notion of referential constraint are proposed and it is shown how generalisation hierarchies can be expressed as sets of referential constraints. It is shown how the stored data model is used in enforcement of the constraints.

Full text

PDF (1.1 MB)

BibTeX record

@TechReport{UCAM-CL-TR-22,
  author =	 {Robson, M.},
  title = 	 {{Constraints in CODD}},
  url = 	 {https://www.cl.cam.ac.uk/techreports/UCAM-CL-TR-22.pdf},
  institution =  {University of Cambridge, Computer Laboratory},
  doi = 	 {10.48456/tr-22},
  number = 	 {UCAM-CL-TR-22}
}