Graphs and algorithms
Data structures and network algorithms
Data structures and network algorithms
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
The design of relational databases
The design of relational databases
Cardinality constraints in semantic data models
Data & Knowledge Engineering
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
The role of deontic logic in the specification of information systems
Logics for databases and information systems
Consequences of assuming a universal relation
ACM Transactions on Database Systems (TODS)
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
On the implication problem for cardinality constraints and functional dependencies
Annals of Mathematics and Artificial Intelligence
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
Finding Real-Valued Single-Source Shortest Paths
Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Selected Papers from a Workshop on Semantics in Databases
Coping with Inconsistent Constraint Specifications
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Deductive Object Oriented Schemas
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
Resolving Constraint Conflicts in the Integration of Entity-Relationship Schemas
ER '97 Proceedings of the 16th International Conference on Conceptual Modeling
On the Consistency of Int-cardinality Constraints
ER '98 Proceedings of the 17th International Conference on Conceptual Modeling
Graph-Theoretical Methods to Construct Entity-Relationship Databases
WG '95 Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
In entity-relationship modelling, cardinality constraints impose restrictions on the number of occurrences of objects in relationships. If violations may appear, cardinality constraints should be treated as soft constraints rather than as integrity constraints. Nevertheless one often expects them to be satisfied at least in average or up to a small number of exceptions. These expectations may compete each other and cause new kinds of inconsistencies. We discuss how these inconsistencies can be detected and repaired.