Advertisement

On the interaction between transitive closure and functional dependencies

  • G. Gottlob
  • M. Schrefl
  • M. Stumptner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 364)

Abstract

Closure dependencies, or CDs, are introduced to capture formally transitive closure relationships between (sequences of) attributes of a relational scheme, e.g., Part and Subpart. First, CDs are studied alone. The implication problem has a simple complete axiomatization. The interaction of CDs with functional dependencies (FDs) is investigated, leading to the following main results: CDs and FDs considered together imply new CDs, but no new FDs, i.e., no other FDs than those already implied by the given FDs alone. CDs together with FDs imply only longer CDs, i.e., CDs that contain more attributes, but not shorter ones. No k-ary axiomatization can fully describe the interaction between FDs and CDs: Although simple complete axiomatizations for CDs alone and FDs alone exist, there is no complete axiomatization for CDs and FDs taken together, in which every rule is k-ary for some fixed k. Finally, we define a generalized form of CDs and state a list of interesting open problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

9 References

  1. [Agra87]
    Agrawal, R.: “Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries.” Proc. IEEE 3rd Int. Conf. on Data Engineering, Los Angeles, 1987, pp.580–590.Google Scholar
  2. [AhBU79]
    Aho, A.V., C. Beeri, J.D. Ullman: “The Theory of Joins in Relational Databases.” ACM TODS 4,3 (September 1979), pp.297–314.Google Scholar
  3. [BeV81]
    Beeri, C., M.Y.Vardi: “Formal Systems for Tuple and Equality Generating Dependencies.” Hebrew Univ.of Jerusalem Tech. Rep. April 1981.Google Scholar
  4. [CaFP84]
    Casanova, M.A., R. Fagin, C.H. Papadimitriou: “Inclusion Dependencies and their interaction with Functional Dependencies.” In: JCSS, 1984, pp. 29–59.Google Scholar
  5. [CaV83]
    Casanova, M.A. and V.M.P. Vidal: “Towards a Sound View Integration Methodology.” In: ACM PODS 1983, pp. 39–48.Google Scholar
  6. [CeG86]
    Ceri, S., G. Gottlob: “Normalization of Relations and Prolog.” Comm. ACM 29,6 (June 1986), pp.524–544.Google Scholar
  7. [CeGL86]
    Ceri, S., G. Gottlob, L. Lavazza: “Translation and Optimization of Logic Queries: The Algebraic Approach.” Proc. of the 12th Int. Conf. on Very Large Data Bases, Kyoto, 1986, pp.395–402.Google Scholar
  8. [CeGT88]
    Ceri, S., G. Gottlob, A. Tanca: “Logic Programming and Databases.” Springer, 1988 (to appear).Google Scholar
  9. [ChV85]
    Chandra, A., M.Y. Vardi: “The implication problem for functional and inclusion dependencies is undecidable.” In: SIAM J. on Computing, 1985, pp. 671–677.Google Scholar
  10. [ChLM81]
    Chandra, A., H. R. Lewis, J. A. Makowsky: “Embedded Implicational Dependencies and their Inference Problem.” Proc. of the ACM Symp. on Theory of Computing 1981, pp. 342–254.Google Scholar
  11. [Fag80]
    Fagin, R.: “Horn Clauses and Database Dependencies.” ACM Symp. on Theory of Computing 1980, pp.123–134.Google Scholar
  12. [Ioa86]
    Ioannidis, Y.E.: “On the computation of the transitive closure of relational operators.” Proc. of the 12th Int. Conf. on Very Large Data Bases, Kyoto, 1986.Google Scholar
  13. [Lu87a]
    Lu, H.: “New Strategies for Computing the Transitive Closure of a Database Relation.” Proc. of the 13th Int. Conf. on Very Large Data Bases, Brighton, 1987.Google Scholar
  14. [Lu87b]
    Lu, H., K. Mikkilieni, J. P. Richardson: “Design and Evaluation of Algorithms to Compute the Transitive Closure of a Database Relation.” Proc. IEEE 3rd Int. Conf. on Data Engineering, Los Angeles 1987, pp. 112–119.Google Scholar
  15. [Mai83]
    Maier, D.: “The Theory of Relational Databases,” Computer Science Press, 1983.Google Scholar
  16. [MaMS79]
    Maier D., A.O. Mendelzon, J. Sagiv: “Testing Implications of Data Dependencies.” ACM TODS, 4,4 (December 1979), pp.455–469.Google Scholar
  17. [Mit83]
    Mitchell J.C.: “Inference Rules for Functional and Inclusion Dependencies.” Proc. ACM PODS 1983, pp.58–69.Google Scholar
  18. [Sad80]
    Sadri F.: “Data Dependencies in the Relational Model of Data: A Generalization.” Doctoral diss., Princeton Univ., Princeton, NJ, October 1980.Google Scholar
  19. [SaU82]
    Sadri F., J.D. Ullman: “A Complete Axiomatization for a Large Class of Dependencies in Relational Databases.” Journal ACM 29,2 (February 1982), pp.363–372.Google Scholar
  20. [SaW81]
    Sagiv Y., S. Walecka: ‘Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies.” Journal ACM 29,1 (January 1981), pp.103–117.Google Scholar
  21. [War62]
    Warshall, S.: “A Theorem on Boolean Matrices.” Journal ACM 9,1 (January 1962), pp. 11–12.CrossRefGoogle Scholar
  22. [War75]
    Warren, H.S.: “A Modification of Warshall's Algorithm for the Transitive Closure of Binary Relations.” Comm. ACM 18,4 (April 1975), pp.218–220.Google Scholar
  23. [Zlo75]
    Zloof, M.M.: “Query-By-Example: Operations on the Transitive Closure.” RC 5526, IBM Yorktown Heights, 1975.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • G. Gottlob
    • 1
  • M. Schrefl
    • 1
  • M. Stumptner
    • 1
  1. 1.Institut für Angewandte InformatikTechnische Universität WienAustria

Personalised recommendations