Skip to main navigation Skip to search Skip to main content

Formal semantics for database schemas

  • University of Massachusetts Boston

Research output: Contribution to journal › Article › peer-review

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 languageEnglish
Pages (from-to)65-77
Number of pages13
JournalInformation Systems
Volume14
Issue number1
DOIs
StatePublished - 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