|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Lin Lin Wang, "Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme"," IEEE Transactions on Software Engineering, vol. 22, no. 4, pp. 271-274, April, 1996. | |||
| BibTex | x | ||
| @article{ 10.1109/32.491651, author = {Lin Lin Wang}, title = {Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme"}, journal ={IEEE Transactions on Software Engineering}, volume = {22}, number = {4}, issn = {0098-5589}, year = {1996}, pages = {271-274}, doi = {http://doi.ieeecomputersociety.org/10.1109/32.491651}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Software Engineering TI - Thorough Investigation into "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme" IS - 4 SN - 0098-5589 SP271 EP274 EPD - 271-274 A1 - Lin Lin Wang, PY - 1996 KW - Attribute KW - database scheme KW - equivalence class KW - Hamiltonian cycle KW - left-right subset KW - representative. VL - 22 JA - IEEE Transactions on Software Engineering ER - | |||
Abstract—This paper describes a technical improvement of a synthesis algorithm for relational database scheme design, which was proposed by Yang et al. in 1988 [6]. 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.
[1] A.V. Aho, C. Beeri, and J.D. Ullman, "The Theory of Joins in Relational Databases," ACM Trans. Database Systems, vol. 4, no. 3, pp. 297-314, Sept. 1979.
[2] G. Ausiello, A. D'Atri, and D. Sacca, "Graph Algorithms for Functional Dependency Manipulation," J. ACM, vol. 30, no. 4, pp. 752-766, Oct. 1983.
[3] P.A. Bernstein, Synthesizing Third Normal Form Relations from Functional Dependencies ACM Trans. Database Systems, vol. 1, no. 4, pp. 277-298, Dec. 1976.
[4] T.W. Ling, F.W. Tompa, and T. Kameda, "An Improved Third Normal Form for Relational Database," ACM Trans. Database Systems, vol. 6, no. 2, pp. 329-346, June 1981.
[5] C.C. Yang, Relational Databases,Englewood Cliffs, N.J.: Prentice Hall, 1986.
[6] C.C. Yang, G. Li, and P.A. Ng, "An Improved Algorithm Based on Subset Closures for Synthesizing a Relational Database Scheme," IEEE Trans. Software Engineering, vol. 14, no. 11, Nov. 1988.
[7] C. Zaniolo, "A New Normal Form for the Design of Relational Database Scheme," ACM Trans. Database Systems, vol. 7, no. 3, pp. 489-499, Sept. 1982.