Skip to main content
SpringerLink
Log in

The additivity problem for data dependencies in incomplete relational databases

  • Conference paper
  • First Online:
Semantics in Databases (SiD 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1358))

Included in the following conference series:

Abstract

Functional dependencies (FDs) and inclusion dependencies (INDs) are the most fundamental integrity constraints that arise in practice in relational databases. We introduce null functional dependencies (NFDs) and null inclusion dependencies (NINDs) to cater for the situation when a database is incomplete and thus contains null values. If a NFD or NIND is weakly satisfied in a database, then there exists a possible world of this database in which the NFD or NIND is satisfied in the standard way. Additivity is the property of the equivalence of the weak satisfaction of a set of NFDs and NINDs, ε, with the individual weak satisfaction of each member of ε in the said database. We show that in general satisfaction of NFDs and NINDs is not additive. The problem that arises is: under what conditions is weak satisfaction of NFDs and NINDs additive. We solve this problem for the following cases: when E is a set of NFDs, when E is a set of unary NINDs and when E is a set of NFDs and unary NINDs. We show that, when the set of NINDs is unary, checking whether E is additive can be done in time polynomial in the size of E.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. W.W. Armstrong, Dependency structures of data base relationships. In: Proceedings of the IFIP Congress, Stockholm, pp. 580–583, 1974.

    Google Scholar 

  3. P. Atzeni and N.M. Morfuni, Functional dependencies in relations with null values. Information Processing Letters 18, (1984), 233–238.

    Article  MathSciNet  Google Scholar 

  4. P. Atzeni and N.M. Morfuni, Functional dependencies and constraints on null values in database relations. Information and Control 70, (1986), 1–31.

    Article  Google Scholar 

  5. P. Atzeni and V. De Antonellis, Relational Database Theory. Redwood City, Ca., Benjamin/Cummings, 1993.

    Google Scholar 

  6. C. Beeri and P.A. Bernstein, Computational problems related to the design of normal form relational schemas. ACM Transactions on Database Systems 4, (1979), 30–59.

    Article  Google Scholar 

  7. C. Beeri, R. Fagin, D. Maier and M. Yannakakis, On the desirability of acyclic database schemes. Journal of the ACM 30, (1983), 479–513.

    Article  Google Scholar 

  8. P. Buneman, A. Jung and A. Ohori. Using powerdomains to generalize relational databases. Theoretical Computer Science 91, (1991), 23–55.

    Article  Google Scholar 

  9. M.A. Casanova, R. Fagin and C.H. Papadimitriou, Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences 28, (1984), 29–59.

    Article  Google Scholar 

  10. E.F. Codd, Extending the database relational model to capture more meaning. ACM Transactions on Database Systems 4, (1979), 379–434.

    Article  Google Scholar 

  11. S.S. Cosmadakis, P.C. Kanellakis and M.Y. Vardi, Polynomial-time implication problems for unary inclusion dependencies. Journal of the ACM 37, (1990), 15–46.

    Article  Google Scholar 

  12. C.J. Date, Referential integrity. In: Relational Database: Selected Writings. Reading, Ma., Addison-Wesley, pp. 41–63, 1986.

    Google Scholar 

  13. C.J. Date and H. Darwen, A Guide to the SQL Standard, third edition. Reading, Ma., Addison-Wesley, 1993.

    Google Scholar 

  14. B.A. Davey and H.A. Priestly, Introduction to Lattices and Order. Cambridge, U.K., Cambridge University Press, 1990.

    Google Scholar 

  15. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness. New York, Freeman, 1979.

    Google Scholar 

  16. G. Grahne, The Problem of Incomplete Information in Relational Databases, Lecture Notes in Computer Science, Volume 554. Berlin, Springer Verlag, 1991.

    Google Scholar 

  17. J. Grant, Incomplete information in a relational database. Fundamenta Informaticae 3, (1980), 363–378.

    Google Scholar 

  18. P. Honeyman, Testing satisfaction of functional dependencies. Journal of the ACM 29, (1982), 668–677.

    Article  Google Scholar 

  19. T. Imielinski and W. Lipski Jr., Incomplete information and dependencies in relational databases. In: Proceedings of the ACM SIGMOD Conference on Management of Data, San Jose, pp. 177–184, 1983.

    Google Scholar 

  20. T. Imielinski and W. Lipski Jr., Incomplete information in relational databases. Journal of the ACM 31, (1984), 761–791.

    Article  Google Scholar 

  21. D.S. Johnson and A. Klug, Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28, (1984), 167–189.

    Article  Google Scholar 

  22. D. Keen and A. Rajasekar, Rough sets and data dependencies. In: Proceedings of the Workshop on Incompleteness and Uncertainty in Information Systems, Montreal, pp. 87–101, 1993.

    Google Scholar 

  23. M. Levene and G. Loizou, Inferring null join dependencies in relational databases. BIT 32, (1992), 413–429.

    Article  Google Scholar 

  24. M. Levene and G. Loizou, The additivity problem for functional dependencies in incomplete relations. Acta Informatica 34, (1997), 135–149.

    Article  Google Scholar 

  25. M. Levene and G. Loizou, Null inclusion dependencies in relational databases. Information and Computation 134, (1997) in press.

    Google Scholar 

  26. M. Levene and G. Loizou, A correspondence between variable relations and three-valued propositional logic. International Journal of Computer Mathematics 55, (1995), 29–38.

    Google Scholar 

  27. M. Levene and G. Loizou, Database design for incomplete relations. Research Note RN/95/18, Department of Computer Science, University College London, 1995.

    Google Scholar 

  28. L. Libkin, A relational algebra for complex objects based on partial information. In: Proceedings of the Symposium on Mathematical Foundations of Database and Knowledge Base Systems, Rostock, Germany, pp. 29–43, 1991.

    Google Scholar 

  29. L. Libkin, A semantics-based approach to design of query languages for partial information. Research report MS-CIS-94-38. Computer and Information Science Department, School of Engineering and Applied Science, Univerity of Pennsylvania, 1994.

    Google Scholar 

  30. Y.E. Lien, Multivalued dependencies with null values in relational databases. In: Proceedings of the International Conference on Very Large Data Bases, Rio de Janeiro, pp. 61–66, 1979.

    Google Scholar 

  31. Y.E. Lien, On the equivalence of database models. Journal of the ACM 29, (1982), 333–362.

    Article  Google Scholar 

  32. D. Maier, A.O. Mendelzon and Y. Sagiv, Testing implications of data dependencies. ACM Transactions on Database Systems 4, (1979), 455–469.

    Article  Google Scholar 

  33. D. Maier, Minimum covers in the relational database model. Journal of the ACM 27, (1980), 664–674.

    Article  Google Scholar 

  34. H. Mannila and K. J. Räihä, The Design of Relational Databases. Reading, Ma., Addison-Wesley, 1992.

    Google Scholar 

  35. J.C. Mitchell, The implication problem for functional and inclusion dependencies. Information and Control 56, (1983), 154–173.

    Article  Google Scholar 

  36. Z. Pwalak, Rough sets. International Journal of Computer and Information Sciences 11, (1982), 341–356.

    Article  Google Scholar 

  37. E. Sciore, Real world MVD's. In: Proceedings of the ACM SIGMOD Conference on Management of Data, Ann Arbor, pp. 121–132, 1981.

    Google Scholar 

  38. B. Thalheim, On semantic issues connected with keys in relational databases permitting null values. Journal of Information Processing Cybernetics 25, (1989), 11–20.

    Google Scholar 

  39. J.D. Ullman, Principles of Database and Knowledge-Base Systems, Vol. I. Rockville, Md., Computer Science Press, 1988.

    Google Scholar 

  40. Y. Vassiliou, Functional dependencies and incomplete information. In: Proceedings of the International Conference on Very Large Data Bases, Montreal, pp. 260–269, 1980.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University College London, Gower Street, WClE 6BT, London, U.K.

    Mark Levene

  2. Birkbeck College, Malet Street, WClE 7HX, London, U.K.

    George Loizou

Authors
  1. Mark Levene
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Loizou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Bernhard Thalheim Leonid Libkin

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Levene, M., Loizou, G. (1998). The additivity problem for data dependencies in incomplete relational databases. In: Thalheim, B., Libkin, L. (eds) Semantics in Databases. SiD 1995. Lecture Notes in Computer Science, vol 1358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035008

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64199-5

  • Online ISBN: 978-3-540-69700-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation