AbstractAmong the many different data dependencies defined, the so-called join dependencies play a central role, since they explicitly capture lossless join properties for relation schemes.In this paper we state some inference rules for join dependencies and embedded join dependencies. A set of two rules is shown to be complete for monadic join dependency inferences (inferences from a single dependency). Furthermore, it is shown that there is no finite set of inference rules that is complete for embedded join dependencies
This paper presents a relational treatment of inference rules for functional and multivalued depende...
AbstractMultivalued dependencies (MVDs) are an important class of relational constraints that is fun...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Among the many different data dependencies defined, the so-called join dependencies play a central r...
AbstractWe investigate whether a sound and complete formal system for join dependencies can be found...
The problem of deciding whether a join dependency [R] and a set F of functional dependencies logica...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
The inference problem for data dependencies in relational databases is the problem of deciding wheth...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
AbstractComputation of the dependency basis is the fundamental step in solving the membership proble...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this pa...
AbstractWe consider conditions that have appeared in the literature with the purpose of defining a “...
AbstractThe present paper deals with an important problem of the relational database theory, with an...
The implication problem is the problem of deciding whether a given set of dependencies implies or e...
This paper presents a relational treatment of inference rules for functional and multivalued depende...
AbstractMultivalued dependencies (MVDs) are an important class of relational constraints that is fun...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Among the many different data dependencies defined, the so-called join dependencies play a central r...
AbstractWe investigate whether a sound and complete formal system for join dependencies can be found...
The problem of deciding whether a join dependency [R] and a set F of functional dependencies logica...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
The inference problem for data dependencies in relational databases is the problem of deciding wheth...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
AbstractComputation of the dependency basis is the fundamental step in solving the membership proble...
One problem concerning the universal relation assumption is the inability of known methods to obtain...
Acyclic Join Dependencies (AJD) play a crucial role in database design and normalization. In this pa...
AbstractWe consider conditions that have appeared in the literature with the purpose of defining a “...
AbstractThe present paper deals with an important problem of the relational database theory, with an...
The implication problem is the problem of deciding whether a given set of dependencies implies or e...
This paper presents a relational treatment of inference rules for functional and multivalued depende...
AbstractMultivalued dependencies (MVDs) are an important class of relational constraints that is fun...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...