Relational schemas with multiplicity bounds, diversity bounds and functional dependencies
DOI10.1007/978-3-031-56940-1_3MaRDI QIDQ6630185FDOQ6630185
Publication date: 30 October 2024
functional dependencycardinality constraintrelational schemaderivation ruleduplicate-freenesssemantic constraintindependence atomArmstrong-propertydiversity boundentailment closurefinite attribute domainmultiplicity bound
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the finite and general implication problems of independence atoms and keys
- Inferences of multivalued dependencies in fixed and undetermined universes
- Full hierarchical dependencies in fixed and undetermined universes
- Appropriate inferences of data dependencies in relational databases
- Controlled query evaluation with open queries for a decidable relational submodel
- On the implication problem for cardinality constraints and functional dependencies
- REDUNDANCY AND THE JUSTIFICATION FOR FOURTH NORMAL FORM IN RELATIONAL DATABASES
- Foundations of Information and Knowledge Systems
- On sampling representatives of relational schemas with a functional dependency
- Constructing Armstrong tables for general cardinality constraints and not-null constraints
This page was built for publication: Relational schemas with multiplicity bounds, diversity bounds and functional dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6630185)
