A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
On the computational algorithm related to antikeys
Journal of Computer Science and Cybernetics
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, dependencydoi:10.15625/1813-9663/14/2/7892 fatcat:hw3gess4vrbbxovmsrjv7png5m