ACM

Communications of the ACM

Home/Magazine Archive/August 1985 (Vol. 28, No. 8)/Database design: composing fully normalized tables.../Abstract

Database design: composing fully normalized tables from a rigorous dependency diagram

By Henry C. Smith
Communications of the ACM, August 1985, Vol. 28 No. 8, Pages 826-838
10.1145/4021.4024
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

A new simplified methodology for relational-database design overcomes the difficulties associated with nonloss decomposition. It states dependencies between data fields on a dependency list and then depicts them unambiguously as interlinked bubbles and doublebubbles on a dependency diagram. From the dependency diagram, a set of fully normalized tables is derived.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.