Abstract
We propose an abstract semantics for database schemas which considers the interaction between the disjointness and the "is-a" relationships between data types. Our approach is based on a system of axioms introduced and proven sound and complete by Atzeni and Parker. By introducing the concept of mergeable family of schemas we propose a design methodology of database schemas whose goal is to generate schemas which are free of inconsistencies and redundancy. We also investigate the generalization and specialization methods of abstraction as a useful tool in the specification of database semantics using as a staring point the conditions formulated by Abiteboul and Hull for the IFO model when the disjointness constraints are present.
| Original language | English |
|---|---|
| Pages (from-to) | 65-77 |
| Number of pages | 13 |
| Journal | Information Systems |
| Volume | 14 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1989 |
ASJC Scopus Subject Areas
- Software
- Information Systems
- Hardware and Architecture
Fingerprint
Dive into the research topics of 'Formal semantics for database schemas'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS