Example relations, and especially Armstrong relations, can be used as user-friendly representations of dependency sets. In this paper we analyze the use of Armstrong relations in database design with functional dependencies, and show how they and the usual representation of dependencies can be used together. Special attention is given to the size of Armstrong relations. We derive new bounds for the size of minimal Armstrong relations for normalized schemes. New algorithms are also given for generating Armstrong relations and for inferring the functional dependencies holding in a relation
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
International audienceComputing functional dependencies from a relation is an impor-tant database to...
Functional dependencies are an integral part of database design. However, they are only defined when...
AbstractExample relations, and especially Armstrong relations, can be used as user friendly represen...
An Armstrong relation satisfies the functional dependencies (FD) implied by a given FD set and viola...
National audienceGiven a set F of functional dependencies (FDs), Armstrong relations for F are examp...
International audienceIn this paper, we propose a new efficient algorithm called Dep-Miner for disco...
AbstractThe main purpose of this paper is to give some new combinatorial algorithms for generating a...
International audienceFrom statistics, sampling technics were proposed and some of them were proved ...
Advances in relational database technology have made available relational database systems that sup...
The main purpose of this paper is to give some results related to Armstrong relations for functional...
For humans, looking at how concrete examples behave is an intuitive way of deriving conclusions. The...
Functional dependencies, a notion originated in Relational Database Theory, are known to admit inter...
A database is said to be C-Armstrong for a finite set Σ of data dependencies in a class C if the dat...
The current schema design theories assume that a database may be regarded as a single relation. From...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
International audienceComputing functional dependencies from a relation is an impor-tant database to...
Functional dependencies are an integral part of database design. However, they are only defined when...
AbstractExample relations, and especially Armstrong relations, can be used as user friendly represen...
An Armstrong relation satisfies the functional dependencies (FD) implied by a given FD set and viola...
National audienceGiven a set F of functional dependencies (FDs), Armstrong relations for F are examp...
International audienceIn this paper, we propose a new efficient algorithm called Dep-Miner for disco...
AbstractThe main purpose of this paper is to give some new combinatorial algorithms for generating a...
International audienceFrom statistics, sampling technics were proposed and some of them were proved ...
Advances in relational database technology have made available relational database systems that sup...
The main purpose of this paper is to give some results related to Armstrong relations for functional...
For humans, looking at how concrete examples behave is an intuitive way of deriving conclusions. The...
Functional dependencies, a notion originated in Relational Database Theory, are known to admit inter...
A database is said to be C-Armstrong for a finite set Σ of data dependencies in a class C if the dat...
The current schema design theories assume that a database may be regarded as a single relation. From...
Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) ...
International audienceComputing functional dependencies from a relation is an impor-tant database to...
Functional dependencies are an integral part of database design. However, they are only defined when...