Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Integer and combinatorial optimization
Integer and combinatorial optimization
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Cardinality constraints in semantic data models
Data & Knowledge Engineering
The entity-relationship model—toward a unified view of data
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
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
Fundamentals of Cardinality Constraints
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
On the global coherence of integrity constraints in UML class diagrams
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Decidable Reasoning in UML Schemas with Constraints
CAiSE '08 Proceedings of the 20th international conference on Advanced Information Systems Engineering
| Hi-index | 0.00 |
Cardinality constraints are a popular way of imposing restrictions to the structure of a database. In this paper, we consider global cardinality constraints which specify lower and upper bounds on the total number of relationships an entity of a fixed type may be involved in. It is natural to ask for the smallest database with non-empty domains that satisfies a given set of these constraints. For global cardinality constraints this problem is proved to be NP-complete. However, the problem can be tackled via branch & bound. In many cases, the relaxed optimization problem can be solved with the help of min-cost flow methods in a suitable network depending on the given database schema.