Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme"
Issue No. 04 - April (1996 vol. 22)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.491651
<p><b>Abstract</b>—This paper describes a technical improvement of a synthesis algorithm for relational database scheme design, which was proposed by Yang et al. in 1988 [<ref rid="bibe02716" type="bib">6</ref>]. The improvement is based on the observation that the original algorithm may lose attributes in a decomposition in special cases, due to an insufficient handling of representatives of equivalence classes formed over a given set of functional dependencies. The paper then proposes a correction of the original algorithm in which this problem disappears.</p>
Attribute, database scheme, equivalence class, Hamiltonian cycle, left-right subset, representative.
L. L. Wang, "Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme"," in IEEE Transactions on Software Engineering, vol. 22, no. , pp. 271-274, 1996.