Equivalence of Relational Database Schemes
From MaRDI portal
Cited in
(23)- Characterisations of multivalued dependency implication over undetermined universes
- Completeness issues for join dependencies derived from the universal relation join dependency
- On characterizing boundedness of database schemes with bounded dependencies
- Deciding implication for functional dependencies in complex-value databases
- Preservation of integrity constraints in definite DATALOG programs
- Equivalence of views by query capacity
- Equivalence of keyed relational schemas by conjunctive queries
- Formal systems for join dependencies
- Inferring multivalued dependencies from functional and join dependencies
- Symmetries of knowledge bases
- A homomorphism theorem for data base mappings
- Connection-trap-free database schemes
- Isotypeness of models and knowledge bases equivalence
- scientific article; zbMATH DE number 1522507 (Why is no real title available?)
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Acyclic join dependency and data base projections
- Logically automorphically equivalent knowledge bases models
- The implication and finite implication problems for typed template dependencies
- Characterizations for functional dependency and Boyce-Codd normal form families
- An algebraic approach to knowledge base models informational equivalence
- Characterization of optimal complements of database views defined by projection
- Efficient and optimal query answering on independent schemes
- A new characterization of FD implication with an application to update anomalies
This page was built for publication: Equivalence of Relational Database Schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3925900)
