Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach

@inproceedings{Gogolla1989AlgebraizationAI,
  title={Algebraization and Integrity Constraints for an Extended Entity-Relationship Approach},
  author={Martin Gogolla},
  booktitle={TAPSOFT, Vol.1},
  year={1989}
}
  • M. Gogolla
  • Published in TAPSOFT, Vol.1 13 March 1989
  • Computer Science
An extended entity-relationship model concentrating nearly all concepts of known "semantic" data models and especially allowing arbitrary user defined data types is introduced. The semantics of the model is described purely in algebraic terms mainly based on the notions of signature, algebra and extension. On this basis a calculus making intensive use of abstract data types is defined and employed for the formulation of typical integrity constaints like functional restrictions and key… 
4 Citations
Towards a semantic view of an extended entity-relationship model
TLDR
The extended ER model is introduced concentrating nearly all concepts of known so-called semantic data models in a few syntactical constructs and a well-founded calculus is developed taking into account data operations on arbitrary user-defined data types and aggregate functions.
On Formal Semantics of Some Semantic Data Models
We explain how diierent semantic data models like the ER model, the ERC approach and the OMT structural modeling method could be transformed into a semantically well-deened extended
Fundamentals and Pragmatics of an Entity-Relationship Approach
  • M. Gogolla
  • Computer Science
    GI Datenbank Rundbrief
  • 1994
TLDR
This text presents a comprehensive introduction to an extended Entity-Relationship model both on a conceptual and on a formal, mathematical level and introduces a language for the formulation of constraints in order to restrict database states to consistent ones.
An Algebraic Semantics for the Object Specification Language TROLL light
TLDR
The basic notions of a pure algebraic semantics for the object specification language TROLL light are worked out, which is to present a transition system where the states represent the states of the specified information system, and state transitions are caused by the occurrence of finite sets of events.

References

SHOWING 1-10 OF 29 REFERENCES
An Algebra for a General Entity-Relationship Model
TLDR
This work is intended to provide a sound basis for the definition of complete entity-relationship DML's, an essential feature to make the ER model fully operational.
Towards an Algebraic Semantics for Database Specification
TLDR
A general definition of admissible states and state sequences as the semantics of a schema specification is discussed briefly and a construction of such a _standard universe from a given key system including certain constraints is given.
Algebraic Specification Schemes for Data Base Systems
TLDR
A hierarchic structuring principle is proposed for the formal specification of data base systems, called an algebraic specification scheme, which is based ongebraic specification techniques for data types, and allows rigorous correctness proofs for their syntax and semantics.
On the Algebraic Specification of Databases
TLDR
S syntactic and semantic analysis of database speci- fication is carried out in order to check whether the class of ad- mitted models Indeed meets the informal ideas in mind.
Principles of Database Systems
A large part is a description of relations, their algebra and calculus, and the query languages that have been designed using these concepts. There are explanations of how the theory can be used to
A Modal System of Algebras for Database Specification and Query/Update Language Support
TLDR
This paper provides a formal system for reasoning about spdric properties of application and the speeiiioation or query/update functions whioh are particular to that application and uses a system of modal logia similar to Hoare-style program logic ror its specification.
Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions
TLDR
In this paper aggregate functions are precisely defined and it is shown that the languages so extended have eqmvalent expressive power.
The relational model with relation-valued attributes
Remarks on the algebra of non first normal form relations
TLDR
An extension of the relational model is proposed consisting of Non First Normal Form (NF2) relations, enriched mainly by so called nest and unnest operations which transform between NF2 relations and the usual ones.
...
...