A formal system for reasoning about functional dependencies (FDs) and subset dependencies (SDS) defined over relational expressions is described. An FD e: X +Y indicates that Y is functionally dependent on X in the relation denoted by expression e; an SD e c f indicates that the relation denoted by e is a subset of that denoted by f. The system is shown to be sound and complete by resorting to the analytic tableaux method. Applications of the system include the problem of determining if a constraint of a subschema is implied by the constraints of the base schema and the development of database design methodologies similar to normalization
International audienceIn this paper, we deal with the functional and approximate dependency inferenc...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
AbstractComputation of the dependency basis is the fundamental step in solving the membership proble...
The theory of relational database dependencies is introduced. It is shown that formal systems for fu...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
AbstractA lattice theoretic approach is developed to study the properties of functional dependencies...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
International audienceIn this paper, we deal with the functional and approximate dependency inferenc...
International audienceIn this paper, we deal with the functional and approximate dependency inferenc...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
AbstractComputation of the dependency basis is the fundamental step in solving the membership proble...
The theory of relational database dependencies is introduced. It is shown that formal systems for fu...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
AbstractA general formalism, called the general dependencies, is presented. The multivalued, mutual,...
Functional dependencies add semantics to a database schema, and are useful for studying various prob...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
AbstractA lattice theoretic approach is developed to study the properties of functional dependencies...
Computation of the dependency basis is the fundamental step in solving the membership problem for fu...
International audienceIn this paper, we deal with the functional and approximate dependency inferenc...
International audienceIn this paper, we deal with the functional and approximate dependency inferenc...
AbstractModern applications increasingly require the storage of data beyond relational structure. Th...
AbstractComputation of the dependency basis is the fundamental step in solving the membership proble...