skip to main content
10.1145/588011.588014acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
Article
Free Access

Dependency characterizations for acyclic database schemes

Published:02 April 1984Publication History

ABSTRACT

Acyclic database schemes have attracted a lot of interest because of the nice properties enjoyed by such schemes. Recently some new acyclicity conditions that are strictly stronger than the normal α-acyclicity have been introduced by Fagin. Because of increased requirements, the database schemes in the new classes have some further useful properties that are not shared by α-acyclic schemes. Therefore the new classes have practical relevance.A database designer may work in terms of attribute sets and data dependencies, and not only in terms of database schemes. Thus it is important to have a characterization for the acyclic schemes of various degree in terms of data dependencies. For α-acyclic schemes such a characterization exists, but for the new classes the question has been open. In this paper we provide characterizations for β-, γ- and Berge-acyclic database schemes. The characterizations can be stated in a simple form: thus they should be useful for the database designer.

References

  1. BBG78 C. Beeri, P.A. Bernstein & N. Goodman, A sophisticate's introduction to database normalisation theory. Proc. of the Fourth International Conference on Very Large Data Bases, September 1978, 113-124.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. BFMY83 C. Beeri, R. Fagin, D. Maier & M. Yannakakis, On the desirability of acyclic database schemes. J. ACM 30, 3 (July 1983), 479-513. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. BeK83 C. Beeri & M. Kifer, Elimination of intersection anomalies from database schemes. Proc. of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 1983, 340-351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Fag83a R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3 (July 1983), 514-550. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Fag83b R. Fagin, Acyclic database schemes (of various degrees): a painless introduction. CAAP'83, 8th Colloquium on Trees in Algebra and Programming, G. Ausiello & M. Protasi (Eds.), Springer-Verlag, 1983, 65-89. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. FMU82 R. Fagin, A.O. Mendelzon & J.D. Ullman, A simplified universal relation assumption and its properties. ACM Transactions on Database Systems 2, 3 (September 1982), 343-360. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. GrR83 G. Grahne & K.-J. Rääihä, Database decomposition into fourth normal form. Proc. of the Ninth International Conference on Very Large Data Bases, M. Schkolnick & C. Thanos (Eds.), October-November 1983, 186-196. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Lie82 Y.E. Lien, On the equivalence of database models. J. ACM 29, 2 (April 1982), 333-362. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Sci81 E. Sciore, Real-world MVD's. Proc. of the ACM SIGMOD 1981 Conference on Management of Data, April 1981, 121-132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Sci83 E. Sciore, Improving database schemes by adding attributes. Proc. of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, March 1983, 340-351. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Ul182a J.D. Ullman, Principles of Database Systems (Second Edition). Computer Science Press, Potomac, Md., 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Ul182b J.D. Ullman, The U.R. strikes back. Proc. of the ACM Symposium on Principles of Database Systems, March 1982, 10-22. Google ScholarGoogle ScholarDigital LibraryDigital Library

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
    PODS '84: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
    April 1984
    341 pages
    ISBN:0897911288
    DOI:10.1145/588011

    Copyright © 1984 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: 2 April 1984

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate642of2,707submissions,24%

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader