Some results related to dense families of database relations
The dense families of database relations were introduced by Järvinen [7]. The aim of this paper is to investigate some new properties of dense families of database relations, and their applications. That is, we characterize functional dependencies and minimal keys in terms of dense families. We give...
Elmentve itt :
| Szerzők: | |
|---|---|
| Dokumentumtípus: | Cikk |
| Megjelent: |
2005
|
| Sorozat: | Acta cybernetica
17 No. 1 |
| Kulcsszavak: | Számítástechnika, Kibernetika |
| Tárgyszavak: | |
| Online Access: | http://acta.bibl.u-szeged.hu/12759 |
| Tartalmi kivonat: | The dense families of database relations were introduced by Järvinen [7]. The aim of this paper is to investigate some new properties of dense families of database relations, and their applications. That is, we characterize functional dependencies and minimal keys in terms of dense families. We give a necessary and sufficient condition for an abitrary family to be R— dense family. We prove that with a given relation R the equality set ER is an R—dense family whose size is at most m(m-1)/2, where m is the number of tuples in R. We also prove that the set of all minimal keys of relation R is the transversal hypergraph of the complement of the equality set ER. We give an effective algorithm finding all minimal keys of a given relation R. We also give an algorithm which from a given relation R finds a cover of functional dependencies that holds in R. The complexity of these algorithms is also esimated. |
|---|---|
| Terjedelem/Fizikai jellemzők: | 173-182 |
| ISSN: | 0324-721X |