Horn Clauses and Database Dependencies

Journal of the ACM (JACM)

Volumn 29, Issue 4, 1982, Pages 952-985

  Fagin, Ronald ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Armstrong database; Armstrong relation; database dependencies; faithfulness; Horn clause; relational database

Indexed keywords

EID: 84976676650     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322344.322347     Document Type: Article

References (60)

1. Aho, A.V., Beeri, C., And Ullman, J.D. The theory of joins in relational databases. ACM Trans. Database Syst. 4, 3 (Sept. 1979), 297–314
2. Armstrong, W.W. Dependency structures of database relationships. Proc. IFIP 74. North Holland, Amsterdam, 1974, pp. 580–583
3. Armstrong, W.W., And Delobel, C. Decompositions and functional dependencies in relations. ACM Trans. Database Syst 5, 4 (Dec. 1980), 404–430
4. Beeri, C. Personal communication, 1979.
5. Beeri, C., And Bernstein, P.A. Computational problems related to the design of normal form relational schemas ACM Trans. Database Syst. 4, 1 (Mar. 1979), 30–59
6. Beeri, C., Dowd, M., Fagin, R., And Statman, R On the structure of Armstrong relations for functional dependencies. To appear in J. ACM.
7. Beeri, C, Fagin, R., And Howard, J.H. A complete automatization for functional and multivalued dependencies in database relations. FTOC. Int. ACM-S1GMOD Conf. on Management of Data, Toronto, Ont., Can., 1977, pp. 17–61
8. Beeri, C., And Vardi, M.Y. A proof procedure for data dependencies. Tech. Rep., Hebrew Univ. of Jerusalem, Jerusalem, Israel, Aug. 1980.
9. Beeri, C., And Vardi, M.Y. Formal systems for tuple and equality-generating dependencies. Tech. Rep, Hebrew Univ. of Jerusalem, Jerusalem, Israel, Apr. 1981
10. Beeri, C, And Vardi, M.Y. The implication problem for data dependencies. In Proc. Sth Int. Conf. on Automata, Languages, and Programming, Lecture Notes m Computer Science 115, Springer-Verlag, New York, 1981, pp. 73–85
11. Brooks, M. Determining correctness by testing. Ph.D Dissertation, Stanford Univ., Stanford, Calif., 1980.
12. Casanova, M. A., Fagin, R., And Papadimitriou, C Inclusion dependencies and their interaction with functional dependencies. Proc. 1st ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, Los Angeles, Calif., 1982, pp. 171–176
13. Chang, C. C., And Keislbr, H.J. Model Theory. North Holland, Amsterdam, 1973.
14. Codd, E.F. Further normalization of the database relational model. In Data Base Systems, Courant Computer Science Symposia 6, R Russin, Ed., Prentice Hall, Englewood Cliffs, N.J., 1971, pp. 33–64
15. Codd, E.F. Relational completeness of data base sub-languages. In Data Base Systems. Courant Computer Science Symposium, R. Rustin, Ed, Prentice Hall, Englewood Cliffs, N.J. 1971, pp. 65–98
16. Cooper, B.C. On the expressive power of query languages. Tech. Rep. TR-14-80, Center for Research in Computing Technology, Harvard Univ., Cambndge, Mass., 1980.
17. Demolombe, R. A syntactical characterization of a subset of definite and safe formulas. Tech. Rep., ONERA-CERT, Toulouse, France, Sept. 1981.
18. Demolombe, R., And Nicolas, J.-M. On the characterization of “valid” formulas for database querying. Tech. Rep., ONERA-CERT, Toulouse, France, Sept. 1981.
19. DiPaola, R. The recursive unsolvability of the decision problem for the class of definite formulas J ACM 16, 2 (Apr. 1969), 324–327
20. Enderton, H.B. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
21. Fagin, R. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst 2, 3 (Sept. 1977), 262–278
22. Fagin, R. Functional dependencies in a relational database and pcopositional logic. IBM J. Res. Devel. 21, 6 (Nov. 1977), 534–544
23. Fagin, R. Horn clauses and database dependencies. Proc. 12th Ann. ACM Symp. on Theory of Computing, Los Angeles, Calif, 1980, pp. 123–134 (extended abstract)
24. Fagin, R. A normal form for relational databases that is based on domains and keys. ACM Trans. Database Syst. 6, 3 (Sept 1981), 387–415
25. Fagin, R Armstrong databases. Proc. 7th IBM Symp. on Mathematical Foundations of Computer Science, Kanagawa, Japan, May 1982.
26. Fagin, R., Maier, D., Ullman, J.D., And Yannakakis, M. Tools for template dependencies. To appear in SIAM J. Comput.
27. Fagin, R., And Vardi, M.Y. Armstrong databases for functional and inclusion dependencies. Res. Rep, RJ3500, IBM Research Laboratory, San Jose, Calif., June 1982.
28. Ginsburg, S., And Zaiddan, S.M. Properties of functional-dependency families. J. ACM 29,3 (July 1982), 678–698
29. Grant, J., And Jacobs, B.E. On the family of generalized dependency constraints. J. ACM 29, 4 (Oct. 1982), 986–997
30. Gratzer, G. Universal Algebra, 2nd ed. Springer-Verlag, New York, 1979.
31. Gurevich, Y., And Lewis, H.R. The inference problem for template dependencies. Proc. 1st ACM SIGACT-SIGMOD Symp. on the Principles of Database Systems, Los Angeles, Calif., 1982, pp. 221–229
32. Horn, A. On sentences which are true of direct unions of algebras J. Symbolic Logic 16 (1951), 14–21
33. Hull, R. Implicational dependency and finite specification. Tech. Rep., Univ. of Southern California, Los Angeles, Calif., 1981.
34. Kanellakis, P.C. On the computational complexity of cardinality constraints in relational databases. Inf. Proc. Lett. 11,2 (Oct. 1980), 98–101
35. Keisler, H.J. Some applications of infinitely long formulas. J. Symbolic Logic 30, 3 (Sept. 1965), 339–349
36. Kuhns, J.L. Answering questions by computer: A logical study. Tech. Rep RM-5428-PR, Rand Corp., Santa Monica, Calif., Dec. 1967.
37. Maier, D., Mendelzon, A And Sagiv, Y. Testing implications of data dependencies. ACM Trans. Database Syst. 4, 4 (Dec. 1979), 455–469
38. Mendelzon, A.O., And Maier, D. Generalized mutual dependencies and the decomposition of database relations. Proc. 5th Int. Conf. on Very Large Data Bases, Rio de Janeiro, Brazil, 1979, pp. 75–82
39. Nicolas, J.-M. First-order logic formalization for functional, multivalued, and mutual dependencies. Proc. ACM SIGMOD Int Conf. on Management of Data, Austin, Texas, 1978, pp. 40–46
40. Nicolas, J.-M. Logic for improving integrity checking in relational databases. To appear in Acta Inf.
41. Paradaens, J. Transitive dependencies in a database scheme. Tech Rep R387, MBLE, Brussels, Belgium, 1979.
42. Paradaens J., And Janssens, D. Decompositions of relations: a comprehensive approach. In Advances in Data Base Theory, Vol. 1, H. Gallaire, J. Minker, and J-M. Nicolas, Eds., Plenum Publishing, New York, 1981.
43. Parker, D.S., And Parsaye-Ghomi, K. Inference involving embedded multivalued dependencies and transitive dependencies Proc. Int. ACM-SIGMOD Conf on Management of Data, Los Angeles, Calif., 1980, pp. 52–57
44. Rissanen, J. Theory of relations for databases-A tutorial survey. Proc. 7th Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 64, J. Winkowski, Ed., Springer-Verlag, New York, pp. 537–551
45. Sadri, F. Personal communication.
46. Sadri, F, And Ullman, J.D. Template dependencies: A large class of dependencies in relational databases and its complete axiomatization. J. ACM 29, 2 (Apr. 1982), 363–372
47. Sagiv, Y., And Walecka, S.F. Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. J. ACM 29, 1 (Jan. 1982), 103–117
48. Sagiv, Y., Delobel, C., Parker, D.S. Jr., And Fagin, R. An equivalence between relational database dependencies and a fragment of prepositional logic. J. ACM 28, 3 (July 1981), 435–453
49. Shoenfield, J.R. Mathematical Logic. Addison-Wesley, Reading, Mass., 1967.
50. Silva, A.M., And Milkanoff, M.A. A method for helping discover the dependencies of a relation. In Advances in Data Base Theory, Vol. 1, H. Gallaire, J. Minker, and J.-M. Nicolas, Eds., Plenum Publishing, New York, 1981.
51. Slagle, J R., And Konivtr, D, Finding resolution proofs using duplicate goals in AND/OR trees. Inf. Set. 4 (1971), 313–342
52. Statman, R. Private communication.
53. Tarski, A. Contributions to the theory of Models I. Nederl. Akad Wetensch. Proc. Ser. A 57 (1954), 572–588.
54. Ullman, J.D. Principles of Database Systems. Computer Science Press, Woodland Hills, Calif., 1980.
55. Vardi, M.Y. The decision problem for database dependencies. Inf. Proc. Lett. 12, 5 (Oct 1981), 251–254
56. Vardi, M.Y. Private communication
57. Vardi, M.Y. The implication and finite implication problems for typed template dependencies. Proc 1st ACM SIGACT-SIGMOD Conf. on Principles of Database Systems, Los Angeles, Calif, 1982, pp. 230–238
58. Yannakakis, M. Private communication.
59. Yannakakis, M., And Papadimitriou, C. Algebraic dependencies. Proc. 21st IEEE Symp. on Foundations of Computer Science, Syracuse, N.Y., 1980, pp. 328–332. To appear in J. Cony. Syst. Sci
60. Zloof, M.M. Query-by-example, Proc. 1975 AFIPS NCC, Vol. 44 AFIPS Press, Arlington, Va., 1975, pp 431–438