Graphs and algorithms
Design by exmple: An application of Armstrong relations
Journal of Computer and System Sciences
Design theory
Theory of linear and integer programming
Theory of linear and integer programming
Some results about functional dependencies
Acta Cybernetica
Acta Cybernetica
On minimum matrix representation of closure operations
Discrete Applied Mathematics
On the satisfiability of dependency constraints in entity-relationship schemata
Information Systems
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions
Discrete Mathematics
The design of relational databases
The design of relational databases
Relational database theory
Cardinality constraints in semantic data models
Data & Knowledge Engineering
Minimum matrix representation of Sperner systems
Discrete Applied Mathematics
Complete rules for n-ary relationship cardinality constraints
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
A relational model of data for large shared data banks
Communications of the ACM
Entity-Relationship Modeling: Foundations of Database Technology
Entity-Relationship Modeling: Foundations of Database Technology
On Orthogonal Double Covers of Graphs
Designs, Codes and Cryptography
On the Interaction Between ISA and Cardinality Constraints
Proceedings of the Tenth International Conference on Data Engineering
Fundamentals of Cardinality Constraints
ER '92 Proceedings of the 11th International Conference on the Entity-Relationship Approach: Entity-Relationship Approach
Decomposition of Relationships through Pivoting
ER '96 Proceedings of the 15th International Conference on Conceptual Modeling
Deductive Object Oriented Schemas
ER '96 Proceedings of the 15th 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
Extremal Graph Theory
Minimal Sample Databases for Global Cardinality Constraints
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Coping with Inconsistent Constraint Specifications
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Reasoning about participation constraints and Chen's constraints
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Functional and multivalued dependencies in nested databases generated by record and list constructor
Annals of Mathematics and Artificial Intelligence
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
Theoretical Computer Science - Logic, language, information and computation
Deciding implication for functional dependencies in complex-value databases
Theoretical Computer Science - Logic, language, information and computation
Know your limits: enhanced XML modeling with cardinality constraints
ER '07 Tutorials, posters, panels and industrial contributions at the 26th international conference on Conceptual modeling - Volume 83
Efficient reasoning about a robust XML key fragment
ACM Transactions on Database Systems (TODS)
On Matrix Representations of Participation Constraints
ER '09 Proceedings of the ER 2009 Workshops (CoMoL, ETheCoM, FP-UML, MOST-ONISW, QoIS, RIGiM, SeCoGIS) on Advances in Conceptual Modeling - Challenging Perspectives
The Implication Problem of Functional Dependencies in Complex-value Databases
Electronic Notes in Theoretical Computer Science (ENTCS)
Numerical constraints on XML data
Information and Computation
Characterization of type hierarchies with open specification
Proceedings of the 2nd international conference on Semantics in databases
ECMDA-FA'07 Proceedings of the 3rd European conference on Model driven architecture-foundations and applications
WoLLIC'07 Proceedings of the 14th international conference on Logic, language, information and computation
A precious class of cardinality constraints for flexible XML data processing
ER'11 Proceedings of the 30th international conference on Conceptual modeling
Verification and Validation of UML Conceptual Schemas with OCL Constraints
ACM Transactions on Software Engineering and Methodology (TOSEM)
Consistency of UML class diagrams with hierarchy constraints
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
On the existence of armstrong data trees for XML functional dependencies
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Conceptual modeling of cardinality constraints in social publishing
International Journal of Intelligent Systems
Efficient derivation of numerical dependencies
Information Systems
APCCM '12 Proceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 130
Efficiency frontiers of XML cardinality constraints
Data & Knowledge Engineering
Guidelines for representing complex cardinality constraints in binary and ternary relationships
Software and Systems Modeling (SoSyM)
| Hi-index | 0.00 |
In database design, integrity constraints are used to express database semantics. They specify the way by that the elements of a database are associated to each other. The implication problem asks whether a given set of constraints entails further constraints. In this paper, we study the finite implication problem for cardinality constraints. Our main result is a complete characterization of closed sets of cardinality constraints. Similar results are obtained for constraint sets containing cardinality constraints, but also key and functional dependencies. Moreover, we construct Armstrong databases for these constraint sets, which are of special interest for example-based deduction in database design.