On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata

  title={On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata},
  author={Maurizio Lenzerini and Paolo Nobili},
The problem of satisfiability of a specific class of integrity constraints in data bases, namely the dependency constraints, is analysed. An Entity-Relationship model is used for expressing data schemata. In this model suitable types of dependency constraints, called cardinality ratio constraints, allow one to impose restrictions on the mappings between entities and relationships. We show that, as far as such a class of constraints is concerned, the usual notion of satisfiability is not… CONTINUE READING
Highly Influential
This paper has highly influenced 14 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 151 citations. REVIEW CITATIONS
83 Citations
9 References
Similar Papers


Publications citing this paper.
Showing 1-10 of 83 extracted citations

152 Citations

Citations per Year
Semantic Scholar estimates that this publication has 152 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

Combinatorial Optimizakon

  • C. H. Papadimitriou, K. Steiglits
  • Prentice-Hall, Englewood Cliffs, N.J.,
  • 1982
1 Excerpt

Numerical Dependenties

  • J. Grant, J. Minker
  • Proc. oj the International Conference on Logical…
  • 1982

Similar Papers

Loading similar papers…