retagged by
149 views
0 votes
0 votes

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.

retagged by

Please log in or register to answer this question.

Related questions

3 votes
3 votes
2 answers
1
iarnav asked Apr 21, 2018
725 views
Please give some example regarding number of edges in dense graph is - |E| < |V2|I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|
0 votes
0 votes
1 answer
2
iarnav asked Apr 21, 2018
1,462 views
Kruskal Time complexity is O(mlog m) then how in upper bound it can be written as - O(m2) How log m = O(m)and O (mn) - How log n = O(n)
1 votes
1 votes
1 answer
3