What is the worst-case time complexity to find attribute closure of a set of elements?
i.e. Let find attribute closure for {AB}+
R(A,B,C,D,E,F,G,H,I,….. up to k time)
{
A → BC
B → DE
D → F
F → GHI
.
.
.
and so on up to k functional dependencies...
}
My answer is O(k^k).
Please verify someone.
