Achievements of Relational Database Schema Design Theory Revisited

Abstract

Database schema design is seen as to decide on formats for time-varying instances, on rules for supporting inferences and on semantic constraints. Schema design aims at both faithful formalization of the application and optimization at design time. It is guided by four heuristics: Separation of Aspects, Separation of Specializations, Infer-ential Completeness and Unique Flavor. A theory of schema design is to investigate these heuristics and to provide insight into how syntactic properties of schemas are related to worthwhile semantic properties, how desirable syntactic properties can be decided or achieved algorithmically, and how the syntactic properties determine costs of storage, queries and updates. Some well-known achievements of design theory for relational databases are reviewed: normal forms, view support, deciding implications of semantic constraints, acyclicity, design algorithms removing forbidden substructures.

DOI: 10.1007/BFb0035004

Extracted Key Phrases

Statistics

01020'99'01'03'05'07'09'11'13'15'17
Citations per Year

75 Citations

Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Biskup1995AchievementsOR, title={Achievements of Relational Database Schema Design Theory Revisited}, author={Joachim Biskup}, booktitle={Semantics in Databases}, year={1995} }