Chase (algorithm): Difference between revisions

Content deleted Content added
Yobot (talk | contribs)
m WP:CHECKWIKI error fixes using AWB (11708)
Line 12:
 
==Example==
Let ''R''(''A'', ''B'', ''C'', ''D'') be a relation schema known to obey the set of functional dependencies ''F'' = {''A''→''B'', ''B''→''C'', ''CD→A''}. Suppose ''R'' is decomposed into three relation schemas S<sub>1</sub> = {''A'', ''D''}, S<sub>2</sub> = {''A'', ''C''} and S<sub>3</sub> = {''B'', ''C'', ''D''}. Determining whether this decomposition is lossless can be done by performing a chase as show below.
 
The initial tableau for this decomposition is: