On the Hypergraphs and candidate keys

Vu Duc Thi


The combinatorial problems are interesting in the relational  datamodel. The theory of hypergraphs was a very useful tool for the solution of combinatorial problems. The transversal and the minimal transversal are important concepts in this theory.

In this paper, base on hypergraph we  give some new characterizations of the set the candidate keys in the relational datamodel.

DOI: https://doi.org/10.15625/1813-9663/13/4/8038 Display counter: Abstract : 149 views. PDF (Tiếng Việt) : 118 views.

Journal of Computer Science and Cybernetics ISSN: 1813-9663

Published by Vietnam Academy of Science and Technology