On the computational algorithm related to antikeys

Vũ Đức Thi
Author affiliations

Authors

  • Vũ Đức Thi Publishing House for Science and Technology

DOI:

https://doi.org/10.15625/1813-9663/14/2/7892

Abstract

The keys and antikeys play important roles for the investigation of functional dependency in the relational datamodel. The main purpose of this paper is to prove that the time complexity of finding a set of antileys for a given relation scheme S is exponential in the number of attributes. Some another results connecting the functional dependency are given.

Key Word and phrase: Relation, relational datamodel, functionsl dependency, relation scheme, generating Armstrong relation, dependency inference, strong schemen, membership problem, closure, closed set, minimal generater, key, minimal key, antikey.

Metrics

Metrics Loading ...

Published

15-03-2016

How to Cite

[1]
V. Đức Thi, “On the computational algorithm related to antikeys”, JCC, vol. 14, no. 2, pp. 1–7, Mar. 2016.

Issue

Section

Computer Science

Most read articles by the same author(s)

1 2 3 4 > >>