DocumentCode
859295
Title
Thorough investigation into “An improved algorithm based on subset closures for synthesizing a relational database scheme”
Author
Lin Lin Wang
Author_Institution
Dept. of Comput. Sci., Chongqing Inst. of Posts & Telecommun., Sichuan
Volume
22
Issue
4
fYear
1996
fDate
4/1/1996 12:00:00 AM
Firstpage
271
Lastpage
274
Abstract
The paper describes a technical improvement of a synthesis algorithm for relational database scheme design, which was proposed by Yang et al. (1988). 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
Keywords
algorithm theory; database theory; equivalence classes; relational databases; software engineering; algorithm correction; attribute loss; decomposition; equivalence classes; functional dependencies; relational database scheme synthesis; synthesis algorithm; Algorithm design and analysis; Artificial intelligence; Notice of Violation; Relational databases;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.491651
Filename
491651
Link To Document