Advertisement

Implication of Functional Dependencies for Recursive Queries

  • José R. Paramá
  • Nieves R. Brisaboa
  • Miguel R. Penabad
  • Ángeles S. Places
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2890)

Abstract

After two decades of research in Deductive Databases, SQL99 [12] brings them again to the foreground given that SQL99 includes queries with linear recursion. Therefore some of the problems solved for the relational model demand our attention again.

In this paper, we tackle the implication of functional dependencies (also known as the FD-FD implication problem) in the deductive model framework. The problem is as follows. GivenP, F, andf, whereP is a Datalog program, Fis a set of functional dependencies defined on the predicates of P, andf is a fd defined over the predicates of P, is it true that for all databasesd defined exclusively on the extensional predicates ofP, dsatisfies Fimplies that P( d) –the output database– satisfies f. Unlike the implication problem of functional dependencies in the relational data model, this problem is undecidable for general Datalog programs.

In this paper, we provide two methods to check if a given set of fds will be satisfied by the output database (without computing such database) for a class of Datalog programs.

Keywords

Functional Dependency Integrity Constraint Deductive Database Argument Position Recursive Rule 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley, Reading (1995)zbMATHGoogle Scholar
  2. 2.
    Abiteboul, S., Hull, R.: Data functions, datalog and negation. In: Proc. Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principle of Database Systems, pp. 143–153 (1988)Google Scholar
  3. 3.
    Aho, A.V., Beeri, C., Ullman, J.D.: The theory of joins in relational databases. ACM TODS 4(3), 297–314 (1979)CrossRefGoogle Scholar
  4. 4.
    Armstong, W.W.: Dependency structures of data base relationships. In: Proc. 1974 IFIP Congress, pp. 580–583 (1974)Google Scholar
  5. 5.
    Beeri, C., Vardi, M.Y.: A proof procedure for data dependencies. J. ACM 31, 718–741 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Bell, S., Brockhausen, P.: Discovery of constraints and data dependencies in databases (extended abstract). In: European Conference on Machine Learning, pp. 267–270 (1995)Google Scholar
  7. 7.
    Bell, S.: Discovery and maintenance of functional dependencies by independencies. In: Knowledge Discovery and Data Mining, pp. 27–32 (1995)Google Scholar
  8. 8.
    Brisaboa, N.R., Gonzalez-Tuchmann, A., Hernández, H.J., Paramá, J.R.: Chasing programs in datalog. In: Proceedings of the 6th International Workshop on Deductive Databases and Logic Programming DDLP 1998. GMDForschungzentrum Informationstechnik GmbH 1998 (GMD Report 22), pp. 13–23 (1998)Google Scholar
  9. 9.
    Gonzalez-Tuchmann, A.: The chase of datalog programs. PhD thesis, New Mexico State University, Department of Computer Science, Las Cruces, NM 88003-0001 (1995)Google Scholar
  10. 10.
    Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM TODS 4(4), 455–469 (1979)CrossRefGoogle Scholar
  11. 11.
    Maier, D.: The Theory of Relational Databases. Computer Science Press, Rockville (1983)zbMATHGoogle Scholar
  12. 12.
    Melton, J., Simon, A.R.: SQL:1999 Understanding Relational Language Components. Morgan Kaufmann, San Francisco (2002)Google Scholar
  13. 13.
    Popa, L., Deutsch, A., Sahuguet, A., Tannen, V.: A chase too far. In: SIGMOD, pp. 273–284 (2000)Google Scholar
  14. 14.
    Popa, L.: Object/Relational Query Optimization with Chase and Backchase. PhD thesis, University of Pennsylvania (2000)Google Scholar
  15. 15.
    Ullman, J.D.: Principles of Database And Knowledge-Base Systems, vol. 1. Computer Science Press, Rockville (1988)Google Scholar
  16. 16.
    Wang, K., Yuan, L.Y.: Preservation of integrity constraints in definite datalog programs. Information Processing Letters 44(4) (1992)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • José R. Paramá
    • 1
  • Nieves R. Brisaboa
    • 1
  • Miguel R. Penabad
    • 1
  • Ángeles S. Places
    • 1
  1. 1.Database Lab. Computer Science Dept.Univ. of A CoruñaA CoruñaSpain

Personalised recommendations