Formal semantics for database schemas
\textit{P. Atzeni} and \textit{D. S. Parker} [Formal properties of net-based knowledge representation schemes. Proc. 2nd IEEE Conf. Data Engineering, 700-706 (1986)] formulated a system of axioms for the concept of a database schema, based on the ``is-a and the disjointness relationships between types. This paper investigates the algebraic properties of this model and of some refinements of it. This approach yields as an important by-product a methodology for designing database schemas which are free of inconsistency and redundancy. Some concrete and typical examples lead to a remarkable clarity in the presentation.
- Architecture and formal model of shared database
- Representing and reasoning on database conceptual schemas
- Complete conceptual schema algebras
- scientific article; zbMATH DE number 3972251 (Why is no real title available?)
- scientific article; zbMATH DE number 41736 (Why is no real title available?)
- An Algorithmic Logic Approach to Formalizing Database Update Semantics
- Formal specification scheme for database applications using requirements particle networks
- Form invariance of schema and exact schema theorem
- Method schemas.
This page was built for publication: Formal semantics for database schemas
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1124390)