Skip to main content
SpringerLink
Log in

A theory of data dependencies over relational expressions

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

Abstract

A class of integrity constraints for the relational model of data, called implicational dependencies over relational expressions (or, simply, IDEXs), is defined. The interest on IDEXs is justified by briefly indicating several logical database design problems where they naturally occur. To reason about IDEXs, a refutation procedure, which is a direct adaptation of first-order analytic tableaux, is introduced. Finally, the refutation procedure is shown to be a decision procedure for a restricted class of IDEXs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. V. Aho, C. Beeri, and J. D. Ullman, The theory of joins in relational databases,ACM Trans. Database Systems 4 (3):297–314 (September, 1979).

    Google Scholar 

  2. W. W. Armstrong, Dependency structures of database relationships,Proc. IF1P 74:580–583 (1974).

    Google Scholar 

  3. C. Beeri, On the membership problem for functional and multivalued dependencies,A CM Trans. Database Systems 5(3):241–259 (September, 1980).

    Google Scholar 

  4. C. Beeri, P. A. Berstein, and N. Goodman, A sophisticates' introduction to database normalization theory, inProceedings of the 4th International Conference on Very Large Data Bases (1978), pp. 113–124.

  5. C. Beeri, M. Dowd, R. Fagin, and R. Statman, On the structure of Armstrong relations for functional dependences,J. ACM (to appear).

  6. C. Beeri, R. Fagin, and J. H. Howard, A complete axiomatization for functional and multivalued dependencies in database relations, inProceedings of the 1977 ACM SIGMOD International Conference on the Management of Data (1971), pp. 47–61.

  7. M. A. Casanova and P. A. Bernstein, A formal system for reasoning about programs accessing a relational database,ACM Trans. Programming Languages and Systems 2 (3):386–414 (July, 1980).

    Google Scholar 

  8. M. A. Casanova, J. M. V. de Castilho, and A. L. Furtado, Properties of the conceptual and external schemas, inProceedings of the TC2—Working Conference on Formal Description of Programming Concepts II, Garmish-Partenkirchen (1982).

  9. M. A. Casanova, R. Fagin, and C. H. Papadimitriou, Inclusion dependences and their interaction with functional dependences,J. Comp. Syst. Sci. (to appear).

  10. A. K. Chandra, H. R. Lewis, and J. A. Makcwsky, Embedded implicational dependencies and their inference problem, inProceedings of the 13th ACM SIGACTI Symposium on Theory of Computing (1981), pp. 342–354.

  11. A. K. Chandra and M. Y. Vardi, The implication problem for functional and inclusion dependences is undecidable (to appear).

  12. E. F. Codd, Relational completeness of data base sublanguages, inData Base Systems, R. Rustin, ed. (Courant Computer Science Symposia No. 6), Prentice-Hall, Englewood Cliffs, New Jersey (1972), pp. 65–98.

    Google Scholar 

  13. C. J. Date,An Introduction to Database Systems, 3rd ed., Addison-Wesley, Reading, Massachusetts (1981).

    Google Scholar 

  14. H. B. Enderton,A Mathematical Introduction to Logic, Academic Press, New York (1972).

    Google Scholar 

  15. R. Fagin, Multivalued dependencies and a new normal form for relational databases,ACM Trans. Database Systems 2 (3):262–278 (September, 1977).

    Google Scholar 

  16. R. Fagin, Functional dependencies in a relational database and prepositional logic,IBM J. Res. Develop. 21 (6):534–544 (November 1977).

    Google Scholar 

  17. R. Fagin, Horn clauses and database dependencies,J. ACM 29 (4):952–985 (October 1982).

    Google Scholar 

  18. J. Grant and B. E. Jacobs, On the family of generalized dependency constraints,J. ACM 29 (4):986–997 (October 1982).

    Google Scholar 

  19. T. Imielinski and W. Lipski, Inverting relational expressions-A uniform and natural technique for various database problems, inProceedings of the 2nd ACM SIGACT- SIGMOD Symposium on Principles of Database Systems (March 1983), pp. 305–311.

  20. W. Joyner, Resolution strategies as decision procedures,J. ACM 23 (3):398–417 (July 1976).

    Google Scholar 

  21. W. Kent, A simple guide to five normal forms in relational database theory,Comm. ACM 26 (2): 120–125 (February 1983).

    Google Scholar 

  22. A. Klug and R. Price, Determining view dependencies using tableaux,ACM Trans. Database Systems 7 (3):361–380 (September 1982).

    Google Scholar 

  23. D. Maier, A. O. Mendelzon, and Y. Sagiv, Testing implications of data dependencies,ACM Trans. Database Systems 4 (4):455–469 (December 1979).

    Google Scholar 

  24. D. Maier,Relational Database Theory, Computer Science Press, Rockville, Maryland (1983).

    Google Scholar 

  25. J. C. Mitchell, Inference rules for functional and inclusion dependencies, inProceedings of the 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (1983), pp. 58–69.

  26. J. C. Michell, The implication problem for functional and inclusion dependencies,Information and Control (to appear).

  27. J.-M. Nicolas, Mutual dependencies and some results on undecomposable relations, inProceedings of the 4th International Conference on Very Large Data Bases (1978).

  28. V. R. Pratt, A practical decision method for prepositional dynamic logic-Preliminary report, inProceedings of the 10th ACM SIGACT Symposium on Theory of Computing (1978), pp. 326–337.

  29. N. Rescher and A. Urquhart,Temporal Logic, Springer-Verlag, Vienna (1971).

    Google Scholar 

  30. J. Rissanen, Independent components of relations,ACM Trans. Database Systems 2 (4):317–325 (December 1977).

    Google Scholar 

  31. F. Sadri and J. D. Ullman, A complete axiomatization for a large class of dependencies in relational databases,J. ACM 29 (2):363–372 (April 1981).

    Google Scholar 

  32. Y. Sagiv and S. Walecka, Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies,J. ACM 29 (1):103–117 (January 1982).

    Google Scholar 

  33. J. M. Smith and D. C. P. Smith, Database abstractions: Aggregation and generalization,ACM Trans. Database Systems 2 (2):105–133 (June 1977).

    Google Scholar 

  34. R. M. Smullyan,First-Order Logic, Springer-Verlag, Berlin (1971).

    Google Scholar 

  35. T. J. Teorey and J. P. Fry,Design of Database Structures, Prentice-Hall, Englewood Cliffs, New Jersey (1982).

    Google Scholar 

  36. D. C. Tsichritzis and A. Klug (eds.), The ANSI/X3/SPARC DBMS framework: Report of the study group on data base management systems,Information Systems 3(3):173–192 (1978).

    Google Scholar 

  37. J. D. Ullman,Principles of Database Systems, 2nd ed., Computer Science Press, Rockville, Maryland (1982).

    Google Scholar 

  38. M. Yannakakis and C. Papadimitriou, Algebraic dependencies,J. Comp. Syst. Sci. 25 (1):2–41 (August 1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centra Cientifico de Brasilia, IBM do Brasil, Caixa Postal 853, 70.000, Brasilia, DF Brasil

    Marco A. Casanova

Authors
  1. Marco A. Casanova
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research supported in part by FINEP and CNPq grant 402090/80 while the author was at the Catholic University of Rio de Janeiro.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Casanova, M.A. A theory of data dependencies over relational expressions. International Journal of Computer and Information Sciences 12, 151–191 (1983). https://doi.org/10.1007/BF00995890

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00995890

Key words

Search

Navigation