scientific article
From MaRDI portal
zbMath0296.68041MaRDI QIDQ4050126
Publication date: 1974
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A note on relation schemes which are in 3NF but not in BCNF, Implication and axiomatization of functional and constant constraints, Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets, Flexible querying in a relational framework supported by possibilistic logic, Insertion anomalies and the justification for 4NF in relational databases, On the size of nonredundant FD-covers, Deciding implication for functional dependencies in complex-value databases, Non-transitive fuzzy dependencies. I, BCNF via Attribute Splitting, A theory of well-connected relations, Computable queries for relational data bases, On covering Boyce-Codd normal forms, On storing arbitrarily many extendible arrays of arbitrary dimensions, The complexity of recognizing 3NF relation schemes, Inclusion and equivalence between relational database schemata, Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in \(O(N^ 2)\) time, Propositional team logics, On database query languages for K-relations, On the complexity of finding the set of candidate keys for a given set of functional dependencies, Design by example: An application of Armstrong relations, Lossless Decompositions in Complex-Valued Databases, QT logic: Simpler and more expressive than predicate calculus, The concept of a linguistic variable and its application to approximate reasoning. I, The concept of a linguistic variable and its application to approximate reasoning. II, The concept of a linguistic variable and its application to approximate reasoning. III, Testing for existence of a covering Boyce-Codd normal form, A temporal relational model and a query language, Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics, The theory of functional and subset dependencies over relational expressions, Structure and complexity of relational queries, Some results on the deductive structure of join dependencies, Equivalence of keyed relational schemas by conjunctive queries, Graphical normal forms based on root dependencies in relational data base systems, Theta-join and normalization, Implementing imprecision in information systems, Characterizations for functional dependency and Boyce-Codd normal form families
