Advertisement

Characterizing data base Dependencies

  • J. A. Makowsky
Session 3: R. Sethi, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

Abstract

We characterize the class of Full Implicational Dependencies introduced by Fagin as the maximal class of dependencies which are safe, admit finite models in a strong sense and admit Armstrong Relations. We also give other more modeltheoretic characterizations of Full and Embedded Implicational Dependencies.

Keywords

Atomic Formula Finite Model Boolean Combination Folk Theorem Order Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [ABU]
    Aho, A.V., Beeri, C. and Ullman, J.D.: The theory of joins in relational databases, 19th FOCS (1977), pp. 107–113.Google Scholar
  2. [BV]
    Beeri, C. and Vardi, M.Y.: On the properties of total join dependencies, Proc. XP1, Workshop on Relational Data Base Theory, Stoney Brook, N.Y. (June 1980).Google Scholar
  3. [Co]
    Cooper, E.C.: On the expressive power of query languages for relational databases, TR-14-80, Center for Research in Computing Technology, Harvard University (1980).Google Scholar
  4. [CLM]
    Chandra, A.K., Lewis, H.R. and Makowsky, J.A.: Embedded implicational dependencies and their inference problem, Proc. XP1, Workshop on Relational Data Base Theory, Stoney Brook, N.Y. (June 1980), SIGACT 1981.Google Scholar
  5. [CK]
    Chang, C.C. and Keisler, H.J.: Model Theory, Studies in Logic and Foundations of Math., Vol. 73 (1973).Google Scholar
  6. [D]
    Delobel, C.: Normalization and hierarchical dependencies in the relational data model, ACM Trans. on Database Systems 3, 3 (1978).Google Scholar
  7. [F77]
    Fagin, R.: Multivalued dependencies and a new normal form for relational data bases, ACM Trans. on Database Systems 2, 3 (1977).Google Scholar
  8. [F80]
    Fagin, R.: Horn clauses and database dependencies, ACM Symp. on Theory of Comp., Los Angeles, CA (April 1980), pp. 123–134.Google Scholar
  9. [Ga]
    Galvin, F.: Horn sentences, Ann. Math. Logic 1, (1970), pp. 389–422.Google Scholar
  10. [GJ]
    Grant, J. and Jacobs, B.E.: On generalized dependencies, to appear.Google Scholar
  11. [Ha]
    Harel, D.: on Folk theorems, Comm. ACM, July 1980.Google Scholar
  12. [Ke]
    Keisler, H.J.: Some applications of infinitely long formulas, J. Symbolic Logic 30, (1965), pp. 339–349.Google Scholar
  13. [M]
    Makowky, J.A.: Securable quantifiers, k-unions and admissible sets, Logic Colloquium '73 (1975), pp. 409–428.Google Scholar
  14. [N]
    Nicolas, J.M.: First order logic formalization for functional, multivalued and mutual dependencies, ACM-SIGMOD Conf. (1978), pp. 40–46.Google Scholar
  15. [P]
    Paredaens, J.: Transitive dependencies in a data base scheme, R 387 MBLE, Brussels (1979).Google Scholar
  16. [PP]
    Parker, D.S., and Parsaye-Ghomi, K.: Inference involving EMVDs and transitive dependencies, TR UCLA.Google Scholar
  17. [PY]
    Papadimitriou, C. and Yannakakis, M.: Algebraic dependencies, 21st FOCS, Syracuse, N.Y. (October 1980), pp. 328–332.Google Scholar
  18. [R78]
    Rissanen, J.: Theory of relations for databases — a tutorial survey 7th Symp. MFCS, Lecture Notes on Comp. Sc. 64 (1978), pp. 536–551.Google Scholar
  19. [SU]
    Sadri, P. and Ullman, J.D.: A complete axiomatization for a large class of dependencies in relational databases, 12th SIGACT (April 1980).Google Scholar
  20. [SW]
    Sagiv, Y. and Walecka, S.: Subset dependencies as an alternative to embedded multivalued dependencies, TR U1UCDCS-R-79-980, Dept. CS, University of Illinois (1979).Google Scholar
  21. [TKY]
    Tanaka, K.Y., Kambayashi, Y. and Yajima, S.: Properties of embedded multi-valued dependencies in a relational database, TR ER78-03, Dept. of Inf. Sc., University of Kyoto (1978).Google Scholar
  22. [U]
    Ullman, J.D., Principles of Database Systems, Computer Science Press (1980).Google Scholar
  23. [Th]
    Tharp, L.: Continuity and elementary logic, JSL 39 (1974), pp. 700–716.Google Scholar
  24. [Va]
    Vardi, M.: The decision problem of database dependencies, preprint June 1980, Weizmann Institute, Israel.Google Scholar
  25. [Va1]
    Vardi,M. This volumeGoogle Scholar
  26. [Va2]
    Vardi,M. Oral communicationGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • J. A. Makowsky
    • 1
  1. 1.Faculty of Computer Science TechnionIsrael Institute of TechnologyHaifaIsrael

Personalised recommendations