Multi-column dependencies in relational databases come associated with twodifferent computational tasks . The detection problem is to decide whether adependency of a certain type and size holds in a given database . The discovery of inclusion-wise minimal UCCs is proven to be equivalent to the transversal hypergraph problem of enumerating the minimal hitting sets of a hypergraph . We further identify the detection of INDs as one of the first natural W[3]complete problems. We show that detection of FDs and INDs is W[2]complete when parameterized by the size of the solution size. We also show that the discovery of maximal INDs and FDs is shown to be shown tobe shown to have been equivalent to enumerating

Author(s) : Thomas Bläsius, Tobias Friedrich, Martin Schirneck

Links : PDF - Abstract

Code :
Coursera

Keywords : detection - inds - discovery - shown - size -

Leave a Reply

Your email address will not be published. Required fields are marked *