An improved algorithm for finding a key of a relation
Sukhamay Kundu · 1985
We present here an improved algorithm to fmd a key of a relation R(A) on the attributes A The algorithm requires O(lKI.IIF/[) time, where IKI is the size of the key obtained and 1141 is the length of the input specification for the functional dependencies F. The previously known algorithms require O(lA/.llfil)time, which can be an order of magnitude larger if IKI is small compared to l-4