Describing candidate keys by hypergraphs
J. Demetrovics ; Vu Duc Thi
Computing and Informatics, Tome 28 (2012) no. 1, / Harvested from Computing and Informatics
Text on Computing and Informatics
In the paper algorithms are given that find a minimal transversal and all minimal transversals, respectively, of a hypergraph. Some other computational problems related to the hypergraphs are also studied. As applications, new characterizations of candidate keys of a relational datamodel are given, and new algorithms that find all candidate keys of a relation and a relation scheme, respectively, are presented.
Publié le : 2012-01-26
Classification:  
@article{cai607,
     author = {J. Demetrovics and Vu Duc Thi},
     title = {Describing candidate keys by hypergraphs},
     journal = {Computing and Informatics},
     volume = {28},
     number = {1},
     year = {2012},
     language = {en},
     url = {http://dml.mathdoc.fr/item/cai607}
}

J. Demetrovics; Vu Duc Thi. Describing candidate keys by hypergraphs. Computing and Informatics, Tome 28 (2012) no. 1, . http://gdmltest.u-ga.fr/item/cai607/