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.
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Fag83a R. Fagin, Degrees of acyclicity for hypergraphs and relational database schemes. J. ACM 30, 3 (July 1983), 514-550. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- Lie82 Y.E. Lien, On the equivalence of database models. J. ACM 29, 2 (April 1982), 333-362. Google ScholarDigital Library
- Sci81 E. Sciore, Real-world MVD's. Proc. of the ACM SIGMOD 1981 Conference on Management of Data, April 1981, 121-132. Google ScholarDigital Library
- 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 ScholarDigital Library
- Ul182a J.D. Ullman, Principles of Database Systems (Second Edition). Computer Science Press, Potomac, Md., 1982. Google ScholarDigital Library
- Ul182b J.D. Ullman, The U.R. strikes back. Proc. of the ACM Symposium on Principles of Database Systems, March 1982, 10-22. Google ScholarDigital Library
Recommendations
Independence-reducible database schemes
PODS '88: Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsA class of cover embedding database schemes, called independence-reducible, is proposed and is proven to be bounded and algebraic-maintainable, and therefore is highly desirable with respect to query answering and constraint enforcement. This class of ...
Join graphs and acyclic database schemes
VLDB '81: Proceedings of the seventh international conference on Very Large Data Bases - Volume 7The use of one acyclic join dependency and a set of functional dependencies appears powerful enough to represent data semantics in a relational database. There are several ways to characterize the acyclic join dependency, each providing its own ...
Comments