Open AccessSome combinatorial algorithms connecting hypergraphs
Author(s) -
Vũ Đức Thi
Publication year - 2016
Publication title -
journal of computer science and cybernetics (vietnam academy of science and technology)/journal of computer science and cybernetics
Language(s) - English
Resource type - Journals
eISSN - 2815-5939
pISSN - 1813-9663
DOI - 10.15625/1813-9663/14/3/7928
Subject(s) - hypergraph , relation (database) , computer science , base (topology) , algorithm , combinatorial method , theoretical computer science , combinatorial design , combinatorial algorithms , mathematics , combinatorics , data mining , mathematical analysis
In the relational datamodel the combinatorial algorithms are constructed many authors. The hypergraph is a important concept in the combinatorial theory. The candidate keys play an essential role in the relational datamodel. In this paper, base on hypergraph we present a new combinatorial algorithm that finds all candidate keys of a give relation. Some another results related to the candidate keys are given.