skip to main content
10.1145/1734714.1734716acmconferencesArticle/Chapter ViewAbstractPublication PagesmodConference Proceedingsconference-collections
research-article
Free Access

Normalized data base structure: a brief tutorial

Published:11 November 1971Publication History

ABSTRACT

Casual and other users of large formatted data bases need a simple tabular (relational) view of the data rather than a network or tree-structured view. This paper illustrates the removal of repeating groups, hierarchic and plex structures, and cross-referencing structures. Finally, the simplification of data base relations by normalization is discussed.

References

  1. F. B. Thompson, P. C. Lockemann, B. H. Dostert, R. S. Deverill, "REL: A Rapidly Extensible Language System", Proc. Nat. ACM August 1969 San Francisco. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. H. Dostert, F. B. Thompson, "How Features Resolve Syntactic Ambiguity", Proceedings of Symposium on Information Storage and Retrieval, University of Maryland, April 1--2, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. B. H. Dostert, F. B. Thompson "Syntactic Analysis in REL English", 1971 International Meeting in Computational Linguistics, Debrecen, Hungary September 1971.Google ScholarGoogle Scholar
  4. Codasyl Systems Committee, "Feature Analysis of Generalized Data Base Management Systems", May 1971, obtainable from ACM HQ, New York, New York. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. E. F. Codd, "A Data Base Sublanguage founded on the Relational Calculus", Proc. 1971 ACM-SIGFIDET Workshop on Data Description, Access and Control, to be available from ACM HQ, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. E. F. Codd, "A Relational Model of Data for Large Shared Data Banks", Comm. ACM 13 6, June 1970, 377--387. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. E. F. Codd, "Further Normalization of the Data Base Relational Model", Courant Computer Science Symposia 6, "Data Base Systems", New York City, May 24--25, 1971, to be published by Prentice-Hall.Google ScholarGoogle Scholar
  8. I. J. Heath, "Unacceptable File Operations in a Relational Data Base", Proc. 1971 ACM-SIGFIDET Workshop on Data Descirption, Access and Control, to be available from ACM HQ, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  1. Normalized data base structure: a brief tutorial

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGFIDET '71: Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
      November 1971
      368 pages
      ISBN:9781450373005
      DOI:10.1145/1734714

      Copyright © 1971 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 11 November 1971

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader