Add to ORKGA simple condition is presented that ensures that a relation scheme R with a set F of functional dependencies has a Boyce-Codd normal form (BCNF)-decomposition that has the lossless-join property and preserves functional dependencies
It is well known that faithful (i.e. dependency preserving) decompositions of relational database sc...
We define extended conflict free dependencies in the context of functional and multivalued dependenc...
The main purpose of this paper is to give some results related to Armstrong relations for functional...
A simple condition is presented that ensures that a relation scheme R with a set F of functional dep...
AbstractIn this paper we present some characterizations of relation schemes in second normal form (2...
AbstractThe main purpose of this paper is to give some new combinatorial algorithms for generating a...
AbstractAn algorithm is given for the lossless decomposition of a relation into Boyce-Codd Normal Fo...
There is a well-known algorithm for determining when a decomposition ˆ {R 1, R 2,...,R m} of a datab...
AbstractThe family of functional dependencies (FDs) was introduced by E. F. Codd. Equivalent descrip...
In the relational database theory the most desirable normal form is the Boyce-Codd normal form (BCN...
AbstractWe define extended conflict free dependencies in the context of functional and multivalued d...
AbstractA functional dependency (fd) family was recently defined [20] as the set of all instances sa...
AbstractExample relations, and especially Armstrong relations, can be used as user friendly represen...
The family of functional dependencies (FDs) was introduced by E.F. Codd. Equivalent descriptions of ...
The normalization of relations was introduced by E. F. Codd. The main purpose of normalization is to...
It is well known that faithful (i.e. dependency preserving) decompositions of relational database sc...
We define extended conflict free dependencies in the context of functional and multivalued dependenc...
The main purpose of this paper is to give some results related to Armstrong relations for functional...
A simple condition is presented that ensures that a relation scheme R with a set F of functional dep...
AbstractIn this paper we present some characterizations of relation schemes in second normal form (2...
AbstractThe main purpose of this paper is to give some new combinatorial algorithms for generating a...
AbstractAn algorithm is given for the lossless decomposition of a relation into Boyce-Codd Normal Fo...
There is a well-known algorithm for determining when a decomposition ˆ {R 1, R 2,...,R m} of a datab...
AbstractThe family of functional dependencies (FDs) was introduced by E. F. Codd. Equivalent descrip...
In the relational database theory the most desirable normal form is the Boyce-Codd normal form (BCN...
AbstractWe define extended conflict free dependencies in the context of functional and multivalued d...
AbstractA functional dependency (fd) family was recently defined [20] as the set of all instances sa...
AbstractExample relations, and especially Armstrong relations, can be used as user friendly represen...
The family of functional dependencies (FDs) was introduced by E.F. Codd. Equivalent descriptions of ...
The normalization of relations was introduced by E. F. Codd. The main purpose of normalization is to...
It is well known that faithful (i.e. dependency preserving) decompositions of relational database sc...
We define extended conflict free dependencies in the context of functional and multivalued dependenc...
The main purpose of this paper is to give some results related to Armstrong relations for functional...