Skip to main content
Log in

Inferring null join dependencies in relational databases

  • Part I Computer Science
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

The inference problem for data dependencies in relational databases is the problem of deciding whether a set of data dependencies logically implies another data dependency. For join dependencies (JDs), the inference problem has been extensively studied by utilising the well-known chase procedure. We generalise JDs to null join dependencies (NJDs) that hold in relations which may contain null values. In our model for incomplete information we allow only a single unmarked null value denoted bynull. This allows us to solve the inference problem for NJDs by extending the chase procedure to the or-chase procedure. In order to define the or-chase procedure we generalise relations with nulls to or-relations which contain a limited form of disjunctive information. The main result of the paper shows that the inference problem for NJDs, including embedded NJDs (which are a special case of NJDs), is decidable; this is realised via the or-chase procedure.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. P. Atzeni and M. C. Bernardis,A new interpretation for null values in the weak instance model, Jour. Comput. Syst. Sci., Vol. 41, pp. 25–43, 1990.

    Google Scholar 

  2. C. Beeri and M. Y. Vardi,On the properties of join dependencies, Advances in Database Theory, Vol. 1, H. Gallaire, J. Minker and J. M. Nicholas, Eds., Plenum Press, New York, 1981, pp. 25–72.

    Google Scholar 

  3. C. Beeri and M. Y. Vardi,A proof procedure for data dependencies, Jour. ACM, Vol. 31, pp. 718–741, 1984.

    Google Scholar 

  4. E. F. Codd,The Relation Model for Database Management: Version 2, Addison Wesley, Reading, MA., 1990.

    Google Scholar 

  5. R. Fagin,Degrees of acyclicity for hypergraphs and relational database systems, Jour. ACM, Vol. 30, pp. 514–550, 1983.

    Google Scholar 

  6. M. H. Graham, A. O. Mendelzon and M. Y. Vardi,Notions of dependency satisfaction, Jour. ACM, Vol. 33, pp. 105–129, 1986.

    Google Scholar 

  7. J. Grant,Incomplete information in a relational database, Fundamenta Informaticae, Vol. 3, pp. 363–378, 1980.

    Google Scholar 

  8. Y. Gurevich and S. Selah,Fixed-point extensions of first-order logic, Annals of Pure and Applied Logic, Vol. 32, pp. 265–280, 1986.

    Google Scholar 

  9. T. Imielinski and W. Lipski Jr.,Incomplete information in relational databases, Jour. ACM, Vol. 31, pp. 761–791, 1984.

    Google Scholar 

  10. T. Imielinski,Incomplete information in logical databases, IEEE Quarterly Bulletin on Data Engineering, Vol. 12, pp. 29–40, 1989.

    Google Scholar 

  11. S. Jajodia and F. N. Springsteel,Lossless outer joins with incomplete information, BIT, Vol. 30, pp. 34–41, 1990.

    Google Scholar 

  12. N. Lerat and W. Lipski Jr.,Nonapplicable nulls, Theoret. Comput. Sci., Vol. 46, pp. 67–82, 1986.

    Google Scholar 

  13. M. Levene,The Nested Universal Relation Database Model, Lecture Notes in Computer Science, Vol. 595, Springer-Verlag, Berlin, 1992.

    Google Scholar 

  14. Y. E. Lien,Multivalued dependencies with null values in relational databases, Proc. of 5th Conf. on Very Large Data Bases, Rio de Janeiro, Brazil, pp. 61–66, 1979.

  15. K.-C. Liu and R. Sunderraman,Indefinite and maybe information in relational databases, ACM Trans. on Database Syst., Vol. 15, pp. 1–39, 1990.

    Google Scholar 

  16. D. Maier, A. O. Mendelzon and Y. Sagiv,Testing implication of data dependencies, ACM Trans. on Database Syst., Vol. 4, pp. 455–469, 1979.

    Google Scholar 

  17. Y. Sagiv and S. F. Walecka,Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies, Jour. ACM, Vol. 29, pp. 103–117, 1982.

    Google Scholar 

  18. D. A. Schmidt,Denotational Semantics: A Methodology for Language Development, Allyn and Beacon, Inc., Newton, MA., 1986.

    Google Scholar 

  19. E. Sciore,A complete axiomatization of join dependencies, Jour. ACM, Vol. 29, pp. 373–393, 1982.

    Google Scholar 

  20. J. Stein and D. Maier,Relaxing the universal relation scheme assumption, Proc. of the 4th ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Portland, OR, ACM, New York, 1985, pp. 76–85.

  21. J. D. Ullman,Principles of Database and Knowledge-Base Systems, Vol. 1, Computer Science Press, Rockville, Maryland, 1988.

    Google Scholar 

  22. C. Zaniolo,Database relations with null values, Jour. Comput. Syst. Sci., Vol. 28, pp. 142–166, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Levene, M., Loizou, G. Inferring null join dependencies in relational databases. BIT 32, 413–429 (1992). https://doi.org/10.1007/BF02074878

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

CR Classification

Key words

Navigation