Cart (Loading....) | Create Account
Close category search window
 

Thorough investigation into “An improved algorithm based on subset closures for synthesizing a relational database scheme”

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Lin Lin Wang ; Dept. of Comput. Sci., Chongqing Inst. of Posts & Telecommun., Sichuan

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

Published in:

Software Engineering, IEEE Transactions on  (Volume:22 ,  Issue: 4 )

Date of Publication:

Apr 1996

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.