AN ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE MAXIMAL RELATIVE BLOCKJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
AN ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE MAXIMAL RELATIVE BLOCKJ. Journal of Computer Research and Development, 1996, 33(10).
AN ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE MAXIMAL RELATIVE BLOCKJ. Journal of Computer Research and Development, 1996, 33(10).
Citation:
AN ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE MAXIMAL RELATIVE BLOCKJ. Journal of Computer Research and Development, 1996, 33(10).
AN ALGORITHM TO FIND ALL PRIME ATTRIBUTES OF A RELATION SCHEMA BASED ON THE MAXIMAL RELATIVE BLOCK
In this paper, the FDs set of a relation schema is partitioned, and then,with a relative block consisting of the corresponding set of attributes, the prime attributes of each maximal relative block are found.Finally, a polynomial-time algorithm to find all prime attributes is given.
DownLoad: