The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations

ACM Transactions on Database Systems

Volumn 37, Issue 2, 2012, Pages

  Hartmann, Sven ^a   Link, Sebastian ^b  

^a CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Axiomatization; Boolean dependency; Boolean logic; Functional dependency; Implication; Incomplete information; Logic of paradox; Multivalued dependency; S 3 logic; SQL

Indexed keywords

AXIOMATIZATION; BOOLEAN DEPENDENCY; BOOLEAN LOGIC; FUNCTIONAL DEPENDENCY; IMPLICATION; INCOMPLETE INFORMATION; LOGIC OF PARADOX; MULTIVALUED DEPENDENCY; S-3 LOGIC; SQL;

ALGORITHMS; SEMANTICS;

EQUIVALENCE CLASSES;

EID: 84863632110     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/2188349.2188355     Document Type: Conference Paper

References (125)

1. ABITEBOUL, S., HULL, R., and VIANU, V. 1995. Foundations of Databases. Addison-Wesley, Boston, MA.
2. [(106) worlds and beyond: Efficient representation and processing of incomplete information. VLDB J. 18, 5, 1021-1040.
3. ARENAS, M., BARCELO, P., LIBKIN, L., and MURLAK, F. 2010. Relational and XML Data Exchange. Synthesis Lectures on Data Management. Morgan & Claypool Publishers.
4. ARENAS, M., FAN, W., and LIBKIN, L. 2008. On the complexity of verifying consistency of XML specifications. SIAM J. Comput. 38, 3, 841-880.
5. ARENAS, M. and LIBKIN, L. 2004. A normal form for XML documents. ACM Trans. Datab. Syst. 29, 1, 195-232.
6. ARENAS, M. and LIBKIN, L. 2005. An information-theoretic approach to normal forms for relational and XML data. J. ACM 52, 2, 246-283. (Pubitemid 41655761)
7. ARMSTRONG, W. W. 1974. Dependency structures of database relationships. Inf. Process. 74, 580-583.
8. ATZENI, P. and MORFUNI, N. 1986. Functional dependencies and constraints on null values in database relations. Inf. Control 70, 1, 1-31. (Pubitemid 17511515)
9. BEERI, C. 1980. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Datab. Syst. 5, 3, 241-259. (Pubitemid 11451515)
10. BEERI, C. and BERNSTEIN, P. 1979. Computational problems related to the design of normal form relational schemas. ACM Trans. Datab. Syst. 4, 1, 30-59. (Pubitemid 9437762)
11. BEERI, C., BERNSTEIN, P. A., and GOODMAN, N. 1978. A sophisticate's introduction to database normalization theory. In Proceedings of the 4th International Conference on Very Large Databases (VLDB). IEEE Computer Society, 113-124.
12. BEERI, C., DOWD, M., FAGIN, R., and STATMAN, R. 1984. On the structure of Armstrong relations for functional dependencies. J. ACM 31, 1, 30-46.
13. BEERI, C., FAGIN, R., and HOWARD, J. H. 1977. A complete axiomatization for functional and multivalued dependencies in database relations. In Proceedings of the SIGMOD International Conference on Management of Data. ACM, 47-61.
14. BEERI, C., FAGIN, R., MAIER, D., and YANNAKAKIS, M. 1983. On the desirability of acyclic database schemes. J. ACM 30, 3, 479-513.
15. BEERI, C. and VARDI, M. 1984. Formal systems for tuple and equality generating dependencies. SIAM J. Comput. 13, 1, 76-98. (Pubitemid 15494574)
16. BERNSTEIN, P. 1976. Synthesizing third normal form relations from functional dependencies. ACM Trans. Datab. Syst. 1, 4, 277-298.
17. BISKUP, J. 1978. On the complementation rule for multivalued dependencies. Acta Inf. 10, 297-305.
18. BISKUP, J. 2009. Security in Computing Systems. Springer.
19. BISKUP, J., DAYAL, U., and BERNSTEIN, P. 1979. Synthesizing independent database schemas. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD). ACM, 143-151.
20. BISKUP, J., EMBLEY, D., and LOCHNER, J. 2008. Reducing inference control to access control for normalized database schemas. Inf. Proc. Letters 106, 1, 8-12. (Pubitemid 351199847)
21. BISKUP, J. and LINK, S. 2011. Appropriate inferences of data dependencies in relational databases. Ann. Math. Artif. Intell. 63, 3-4, 213-255.
22. BISKUP, J. and WEIBERT, T. 2008. Keeping secrets in incomplete databases. Int. J. Inf. Sec. 7, 3, 199-217. (Pubitemid 351722211)
23. BOJANCZYK, M., MUSCHOLL, A., SCHWENTICK, T., and SEGOUFIN, L. 2009. Two-Variable logic on data trees and XML reasoning. J. ACM 56, 3, Article 13.
24. BÖRGER, E., GRÄDEL, E., and GUREVICH, Y. 1997. The Classical Decision Problem. Springer.
25. CADOLI, M. and SCHAERF, M. 1996. On the complexity of entailment in propositional multivalued logics. Ann. Math. Artif. Intell. 18, 1, 29-50.
26. CALI, A., CALVANESE, D., DE GIACOMO, G., and LENZERINI, M. 2004. Data integration under integrity constraints. Inf. Syst. 29, 2, 147-163.
27. CASANOVA, M., FAGIN, R., and PAPADIMITRIOU, C. 1984. Inclusion dependencies and their interaction with functional dependencies. J. Comput. System Sci. 28, 1, 29-59. (Pubitemid 14569358)
28. CHANDRA, A., LEWIS, H., and MAKOWSKY, J. 1981. Embedded implicational dependencies and their inference problem. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC). ACM, 342-354.
29. CHOMICKI, J. 2007. Consistent query answering: Five easy pieces. In Proceedings of the 11th International Conference on Database Theory (ICDT). Lecture Notes in Computer Science Series, vol. 4353, Springer, 1-17.
30. CODD, E. F. 1970. A relational model of data for large shared data banks. Comm. ACM 13, 6, 377-387.
31. CODD, E. F. 1975. Understanding relations. ACM SIGFIDET FDT Bull. 7, 3-4, 23-28.
32. CODD, E. F. 1979. Extending the database relational model to capture more meaning. ACM Trans. Datab. Syst. 4, 4, 397-434. (Pubitemid 10433772)
33. CRESSWELL, M. and HUGHES, G. 1996. A New Introduction to Modal Logic. Routledge, London and New York.
34. DATE, C. and DARWEN, H. 1997. A Guide to the SQL Standard. Addison-Wesley Professional, Reading, MA.
35. DAVIDSON, S., FAN, W., and HARA, C. 2007. Propagating XML constraints to relations. J. Comput. Syst. Sci. 73, 3, 316-361. (Pubitemid 46027078)
36. DAVIS, M. and PUTNAM, H. 1960. A computing procedure for quantification theory. J. A C M 7, 201-215.
37. DE MARCHI, F., LOPES, S., PETIT, J.-M., and TOUMANI, F. 2003. Analysis of existing databases at the logical level: The DBA companion project. SIGMOD Rec. 32, 1, 47-52. (Pubitemid 40536098)
38. DE MARCHI, F. and PETIT, J.-M. 2007. Semantic sampling of existing databases through informative Armstrong databases. Inf. Syst. 32, 3, 446-457. (Pubitemid 44822640)
39. DELOBEL, C. 1978. Normalization and hierarchical dependencies in the relational data model. ACM Trans. Datab. Syst. 3, 3, 201-222. (Pubitemid 9387905)
40. DELOBEL, C. and ADIBA, M. 1985. Relational Database Systems. Elsevier North Holland, New York.
41. DEMETROVICS, J., KATONA, G., MIKLOS, D., and THALHEIM, B. 2006. On the number of independent functional dependencies. In Proceedings of the 4th International Symposium on Foundations of Information and Knowledge Bases (FoIKS). Lecture Notes in Computer Science, vol. 3861, Springer, 83-91. (Pubitemid 43973743)
42. DEUTSCH, A., LUDÄSCHER, B., and NASH, A. 2007. Rewriting queries using views with access patterns under integrity constraints. Theor. Comput. Sci. 371, 3, 200-226. (Pubitemid 46215858)
43. DEUTSCH, A., POPA, L., and TANNEN, V. 2006. Query reformulation with constraints. SIGMOD Rec. 35, 1, 65-73. (Pubitemid 43383850)
44. DIEDERICH, J. and MILTON, J. 1988. New methods and fast algorithms for database normalization. ACM Trans. Datab. Syst. 13, 3, 339-365. (Pubitemid 18655810)
45. DOWLING, W. and GALLIER, J. 1984. Linear-time algorithms for testing the satisfiability of propositional Horn formulae. J. Log. Program. 1, 3, 267-284. (Pubitemid 15564552)
46. ENGEL, K. 1997. Sperner Theory. Cambridge University Press, Cambridge, UK.
47. FAGIN, R. 1977a. Functional dependencies in a relational data base and propositional logic. IBM J. Res. Devel. 21, 6, 543-544.
48. FAGIN, R. 1977b. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Datab. Syst. 2, 3, 262-278. (Pubitemid 8561220)
49. FAGIN, R. 1982a. Armstrong databases. Tech. rep. RJ3440(40926), IBM Research Laboratory, San Jose, CA.
50. FAGIN, R. 1982b. Horn clauses and database dependencies. J. ACM 29, 4, 952-985.
51. FAGIN, R., KOLAITIS, P., MILLER, R., and POPA, L. 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336, 1, 89-124. (Pubitemid 40612385)
52. FAGIN, R., KOLAITIS, P., POPA, L., and TAN, W. 2009. Reverse data exchange: coping with nulls. In Proceedings of the 28th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS). ACM, 23-32.
53. FAGIN, R. and VARDI, M. 1986. The theory of data dependencies - A survey. In Mathematics of Information Processing. Proceedings of Symposia in Applied Mathematics Series, vol. 34, American Mathematical Society, 19-72.
54. FAN, W., GEERTS, F., JIA, X., and KEMENTSIETSIDIS, A. 2008. Conditional functional dependencies for capturing data inconsistencies. ACM Trans. Datab. Syst. 33, 2, Article 6.
55. FARKAS, C. and JAJODIA, S. 2002. The inference problem: a survey. SIGKDD Explor. 4, 2, 6-11.
56. FERRAROTTI, F., HARTMANN, S., KÖHLER, H., LINK, S., and VINCENT, M. 2011. The Boyce-Codd-Heath normal form for SQL. In Proceedings of the 18th International Workshop on Logic, Language, Information and Computation (WoLLIC). Lecture Notes in Artificial Intelligence, vol. 6642, Springer, 110-122.
57. GALIL, Z. 1982. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29, 1, 96-102.
58. GOTTLOB, G., PICHLER, R., and WEI, F. 2010. Tractable database design and datalog abduction through bounded treewidth. Inf. Syst. 35, 3, 278-298.
59. GOTTLOB, G. and ZICARI, R. 1988. Closed world databases opened through null values. In Proceedings of the 14th International Conference on Very Large Databases (VLDB). IEEE Computer Society, 50-61.
60. GRAHNE, G. 1984. Dependency satisfaction in databases with incomplete information. In Proceedings of the 10th International Conference on Very Large Databases (VLDB). IEEE Computer Society, 37-45. (Pubitemid 16526813)
61. GRAHNE, G. and RÄIHÄ, K.-J. 1983. Database decomposition into Fourth Normal Form. In Proceedings of the 9th International Conference on Very Large Databases (VLDB). IEEE Computer Society, 186-196. (Pubitemid 14573629)
62. GRANT, J. 1977. Null values in a relational data base. Inf. Process. Lett. 6, 5, 156-157.
63. HAGIHARA, K., ITO, M., TANIGUCHI, K., and KASAMI, T. 1979. Decision problems for multivalued dependencies in relational databases. SIAM J. Comput. 8, 2, 247-264.
64. HARTMANN, S., KIRCHBERG, M., and LINK, S. 2012. Design by example for SQL table definitions with functional dependencies. VLDB J. 21, 1, 121-144.
65. HARTMANN, S., LECK, U., and LINK, S. 2011. On Codd families of keys over incomplete relations. Comput. J. 54, 7, 1166-1180.
66. HARTMANN, S. and LINK, S. 2008. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic 152, 1-3, 84-106.
67. HARTMANN, S. and LINK, S. 2009. Efficient reasoning about a robust XML key fragment. ACM Trans. Datab. Syst. 34, 2, Article 10.
68. HARTMANN, S. and LINK, S. 2010a. Numerical constraints on XML data. Inf. Comput. 208, 5, 521-544.
69. HARTMANN, S. and LINK, S. 2010b. When data dependencies over SQL tables meet the Logics of Paradox and S-3. In Proceedings of the 29th ACM SIGMOD-SIGART-SIGACT Symposium on Principles of Database Systems (PODS). ACM, 317-326.
70. IMIELINKSI, T. 1989. Incomplete information in logical databases. IEEE Data Eng. Bull. 12, 2, 29-40.
71. IMIELINSKI, T. and LIPSKI JR., W. 1984. Incomplete information in relational databases. J. ACM 31, 4, 761-791.
72. IMIELINSKI, T., VAN der MEYDEN, R., and VADAPARTY, K. 1995. Complexity tailored design: a new design methodology for databases with incomplete information. J. Comput. Syst. Sci. 51, 3, 405-432.
73. JENSEN, C., SNODGRASS, R., and SOO, M. 1996. Extending existing dependency theory to temporal databases. IEEE Trans. Knowl. Data Engin. 8, 4, 563-582. (Pubitemid 126774379)
74. KHARDON, R., MANNILA, H., and ROTH, D. 1999. Reasoning with examples: Propositional formulae and database dependencies. Acta Inf. 36, 267-286.
75. KLEENE, S. 1952. An Introduction to Metamathematics. North Holland, Amsterdam, The Netherlands.
76. KLUG, A. and PRICE, R. 1982. Determining view dependencies using tableaux. ACM Trans. Datab. Syst. 7, 3, 361-380.
77. KÖHLER, H. and LINK, S. 2010. Armstrong axioms and Boyce-Codd-Heath normal form under bag semantics. Inf. Process. Lett. 110, 16, 717-724.
78. KOLAHI, S. 2007. Dependency-Preserving normalization of relational and XML data. J. Comput. Syst. Sci. 73, 4, 636-647. (Pubitemid 46440978)
79. KOLAHI, S. and LIBKIN, L. 2010. An information-theoretic analysis of worst-case redundancy in database design. ACM Trans. Datab. Syst. 35, 1, Article 5.
80. LANGEVELDT, W. and LINK, S. 2010. Empirical evidence for the usefulness of Armstrong relations on the acquisition of meaningful functional dependencies. Inf. Syst. 35, 3, 352-374.
81. LEVENE, M. and LOIZOU, G. 1997. Null inclusion dependencies in relational databases. Inf. Comput. 136, 2, 67-108. (Pubitemid 127454003)
82. LEVENE, M. and LOIZOU, G. 1998. Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci. 206, 1-2, 283-300. (Pubitemid 128451188)
83. LEVENE, M. and LOIZOU, G. 1999. Database design for incomplete relations. ACM Trans. Datab. Syst. 24, 1, 80-125.
84. LEVESQUE, H. 1989. A knowledge-level account of abduction. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI). Morgan Kaufmann, 1061-1067.
85. LIBKIN, L. and WONG, L. 1996. Semantic representations and query languages for Or-sets. J. Comput. Syst. Sci. 52, 1, 125-142. (Pubitemid 126340854)
86. LIEN, E. 1982. On the equivalence of database models. J. ACM 29, 2, 333-362.
87. LINK, S. 2008a. Charting the completeness frontier of inference systems for multivalued dependencies. Acta Inf. 45, 7-8, 565-591.
88. LINK, S. 2008b. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci. 19, 3, 691-715.
89. LINK, S. 2012. Characterizing multivalued dependency implication over undetermined universes. J. Comput. Syst. Sci. 78, 4, 1026-1044.
90. MAKINOUCHI, A. 1977. A consideration on normal form of not-necessarily-normalized relation in the relational data model. In Proceedings of the 3rd International Conference on Very Large Databases (VLDB). IEEE Computer Society, 447-453. (Pubitemid 8567817)
91. MAKOWSKY, J. and VARDI, M. 1986. On the expressive power of data dependencies. Acta Inf. 23, 3, 231-244.
92. MALVESTUTO, F. 1992. A unique formal system for binary decompositions of database relations, probability distributions, and graphs. Inf. Sci. 59, 1-2, 21-52.
93. MANNILA, H. and RÄIHÄ, K.-J. 1986. Design by example: An application of Armstrong relations. J. Comput. Syst. Sci. 33, 2, 126-141.
94. MANNILA, H. and RÄIHÄ, K.-J. 1994. Algorithms for inferring functional dependencies from relations. Data Knowl. Engin. 12, 1, 83-99.
95. MARQUIS, P. and PORQUET, N. 2003. Resource-Bounded paraconsistent inference. Ann. Math. Artif. Intell. 39, 349-384. (Pubitemid 38103551)
96. NIEPERT, M., VAN GUCHT, D., and GYSSENS, M. 2010. Logical and algorithmic properties of stable conditional independence. Int. J. Approx. Reason. 51, 5, 531-543.
97. PAREDAENS, J., DE BRA, P., GYSSENS, M., and VAN GUCHT, D. 1989. The Structure of the Relational Database Model. Springer.
98. PAULLEY, G. 2000. Exploiting functional dependence in query optimization. Tech. rep. UW-CS-2000-11, University of Waterloo, Waterloo, Canada.
99. Paulley, G. and Larson, P.-A. 1994. Exploiting uniqueness in query optimization. In Proceedings of the 10th International Conference on Data Engineering (ICDE). IEEE Computer Society, 68-79.
100. PETROV, S. Y. 1989. Finite axiomatization of languages for representation of system properties: Axiomatization of dependencies. Inf. Sci. 47, 339-372.
101. PRIEST, G. 1979. Logic of paradox. J. Philos. Logic 8, 219-241.
102. REITER, R. 1978. On closed world data bases. In Logic and Data Bases, Plenum Press, New York, 119-140.
103. ROBINSON, J. 1965. A machine oriented logic based on resolution principle. J. A C M 12, 397-415.
104. SAGIV, Y. 1980. An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM 27, 2, 250-262.
105. SAGIV, Y., DELOBEL, C., PARKER JR., D. S., and FAGIN, R. 1981. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28, 3, 435-453. (Pubitemid 12509177)
106. SAGIV, Y., DELOBEL, C., PARKER JR., D. S., and FAGIN, R. 1987. Correction to "An equivalence between relational database dependencies and a fragment of propositional logic". J. ACM 34, 4, 1016-1018.
107. SAXTON, L. and TANG, X. 2004. Tree multivalued dependencies for XML datasets. In Proceedings of the 5th International Conference on Advances in Web-Age Information Management (WAIM). Lecture Notes in Computer Science, vol. 3129, Springer, 357-367.
108. SCHAERF, M. and CADOLI, M. 1995. Tractable reasoning via approximation. Artif. Intell. 74, 249-310.
109. SILVA, A. and MELKANOFF, M. 1979. A method for helping discover the dependencies of a relation. In Proceedings of the Workshop on Formal Bases for Data Bases - Advances in Data Base Theory. Plemum Press, 115-133.
110. SÖZAT, M. and YAZICI, A. 2001. A complete axiomatization for fuzzy functional and multivalued dependencies in fuzzy database relations. ACM Fuzzy Sets Syst. 117, 2, 161-181.
111. TARI, Z., STOKES, J., and SPACCAPIETRA, S. 1997. Object normal forms and dependency constraints for objectoriented schemata. ACM Trans. Datab. Syst. 22, 513-569. (Pubitemid 127449843)
112. THALHEIM, B. 2000. Entity-Relationship Modeling. Springer.
113. TOMAN, D. and WEDDELL, G. 2008. On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reason. 40, 2-3, 117-132.
114. VADAPARTY, K. and NAQVI, S. 1995. Using constraints for efficient query processing in nondeterministic databases. IEEE Trans. Knowl. Data Engin. 7, 6, 850-864.
115. VARDI, M. 1982. The complexity of relational query languages. In Proceedings of the 14th ACM Symposium on Theory of Computing (STOC). ACM, 137-146.
116. VINCENT, M. 1999. Semantic foundations of 4NF in relational database design. Acta Inf. 36, 3, 173-213.
117. VINCENT, M. and LIU, J. 2003. Multivalued dependencies and a 4NF for XML. In Proceedings of the 15th International Conference on Advanced Information Systems Engineering (CaISE). Lecture Notes in Computer Science, vol. 2681, Springer, 14-29.
118. VINCENT, M., LIU, J., and LIU, C. 2004. Strong functional dependencies and their application to normal forms in XML. ACM Trans. Datab. Syst. 29, 3, 445-462.
119. Weddell, G. 1992. Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Datab. Syst. 17, 1, 32-64. (Pubitemid 23609946)
120. WIJSEN, J. 1999. Temporal FDs on complex objects. ACM Trans. Datab. Syst. 24, 1, 127-176. (Pubitemid 129598107)
121. WONG, S., BUTZ, C., and WU, D. 2000. On the implication problem for probabilistic conditional independency. Trans. Syst. Man Cybernet. A: Syst. Hum. 30, 6, 785-805. (Pubitemid 32169091)
122. WU, M. 1992. The practical need for fourth normal form. In Proceedings of the 23rd ACM SIGCSE Technical Symposium on Computer Science Education. ACM, 19-23. (Pubitemid 23608187)
123. ZANIOLO, C. 1980. Mixed transitivity for functional and multivalued dependencies in database relations. Inf. Process. Lett. 10, 1, 32-34. (Pubitemid 10472463)
124. ZANIOLO, C. 1984. Database relations with null values. J. Comput. Syst. Sci. 28, 1, 142-166.
125. ZIARKO, W. 1991. The discovery, analysis, and representation of data dependencies in databases, In Knowledge Discovery in Databases, MIT Press, Cambridge, MA, 195-212.