On the Hypergraphs and candidate keys

Vu Duc Thi
Author affiliations

Authors

  • Vu Duc Thi Publishing House for Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/13/4/8038

Abstract

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.

Metrics

Metrics Loading ...

Published

03-04-2016

How to Cite

[1]
V. D. Thi, “On the Hypergraphs and candidate keys”, JCC, vol. 13, no. 4, p. 98–102, Apr. 2016.

Issue

Section

Computer Science