Equivalence of Relational Database Schemes
From MaRDI portal
Publication:3925900
DOI10.1137/0210025zbMath0472.68056OpenAlexW2061462629MaRDI QIDQ3925900
Catriel Beeri, Jeffrey D. Ullman, Yehoshua Sagiv, Alberto O. Mendelzon
Publication date: 1981
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0210025
Related Items
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, Efficient and optimal query answering on independent schemes, Deciding implication for functional dependencies in complex-value databases, A new characterization of FD implication with an application to update anomalies, Completeness issues for join dependencies derived from the universal relation join dependency, Symmetries of knowledge bases, Characterisations of multivalued dependency implication over undetermined universes, A homomorphism theorem for data base mappings, Inferring multivalued dependencies from functional and join dependencies, Unnamed Item, Connection-trap-free database schemes, Logically automorphically equivalent knowledge bases models, On characterizing boundedness of database schemes with bounded dependencies, Isotypeness of models and knowledge bases equivalence, Preservation of integrity constraints in definite DATALOG programs, An algebraic approach to knowledge base models informational equivalence, Equivalence of views by query capacity, Characterization of Optimal Complements of Database Views Defined by Projection, Equivalence of keyed relational schemas by conjunctive queries, Acyclic join dependency and data base projections, Characterizations for functional dependency and Boyce-Codd normal form families, Formal systems for join dependencies, The implication and finite implication problems for typed template dependencies
