When data dependencies over SQL tables meet the logics of paradox and S-3

We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We further show that in the absence of NOT NULL constraints the associated implication problem is equivalent to that in propositional fragments of Priest's paraconsistent Logic of Paradox. Subsequently, we extend the equivalence to Boolean dependencies and to the presence of NOT NULL constraints using Schaerf and Cadoli's S-3 logics where S corresponds to the set of attributes declared NOT NULL. The findings also apply to Codd's interpretation "value at present unknown" utilizing a weak possible world semantics. Our results establish NOT NULL constraints as an effective mechanism to balance the expressiveness and tractability of consequence relations, and to control the degree by which the existing classical theory of data dependencies can be soundly approximated in practice.

[1]  BeeriCatriel.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980 .

[2]  Carlo Zaniolo.  Database relations with null values , 1982, PODS '82.

[3]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[4]  Philip A. Bernstein,et al.  Computational problems related to the design of normal form relational schemas , 1979, TODS.

[5]  Wei Li,et al.  On logic of paradox , 1995, Proceedings 25th International Symposium on Multiple-Valued Logic.

[6]  Paolo Atzeni,et al.  Functional Dependencies and Constraints on Null Values in Database Relations , 1986, Inf. Control..

[7]  Joachim Biskup.  Inferences of Multivalued Dependencies in Fixed and Undetermined Universes , 1980, Theor. Comput. Sci..

[8]  Ronald Fagin,et al.  Multivalued dependencies and a new normal form for relational databases , 1977, TODS.

[9]  Catriel Beeri,et al.  A complete axiomatization for functional and multivalued dependencies in database relations , 1977, SIGMOD '77.

[10]  Sebastian Link,et al.  Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes , 2008, FoIKS.

[11]  Solmaz Kolahi,et al.  Dependency-preserving normalization of relational and XML data , 2007, J. Comput. Syst. Sci..

[12]  Margaret S. Wu,et al.  The practical need for fourth normal form , 1992, SIGCSE '92.

[13]  Mark Levene,et al.  Axiomatisation of Functional Dependencies in Incomplete Relations , 1998, Theor. Comput. Sci..

[14]  Ronald Fagin,et al.  An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic , 1981, JACM.

[15]  Claude Delobel,et al.  Normalization and hierarchical dependencies in the relational data model , 1978, TODS.

[16]  Chengfei Liu,et al.  Strong functional dependencies and their application to normal forms in XML , 2004, TODS.

[17]  Hector J. Levesque,et al.  A Knowledge-Level Account of Abduction , 1989, IJCAI.

[18]  Marcelo Arenas,et al.  A normal form for XML documents , 2004, TODS.

[19]  Sven Hartmann,et al.  Efficient reasoning about a robust XML key fragment , 2009, TODS.

[20]  Y. Edmund Lien,et al.  On the Equivalence of Database Models , 1982, JACM.

[21]  Pierre Marquis,et al.  Resource-Bounded Paraconsistent Inference , 2003, Annals of Mathematics and Artificial Intelligence.

[22]  Sebastian Link.  On the Implication of Multivalued Dependencies in Partial Database Relations , 2008, Int. J. Found. Comput. Sci..

[23]  Sebastian Link,et al.  Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies , 2010, Inf. Syst..

[24]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[25]  Grant E. Weddell,et al.  Reasoning about functional dependencies generalized for semantic data models , 1992, TODS.

[26]  Marco Schaerf,et al.  Tractable Reasoning via Approximation , 1995, Artif. Intell..

[27]  Tadao Kasami,et al.  Decision Problems for Multivalued Dependencies in Relational Databases , 1979, SIAM J. Comput..

[28]  Marco Schaerf,et al.  On the complexity of entailment in propositional multivalued logics , 1996, Annals of Mathematics and Artificial Intelligence.

[29]  David Toman,et al.  On Keys and Functional Dependencies as First-Class Citizens in Description Logics , 2006, IJCAR.

[30]  Michael L. Brodie,et al.  Relational Database Systems , 1983, Springer Berlin Heidelberg.

[31]  Ronald Fagin,et al.  Functional Dependencies in a Relational Data Base and Propositional Logic , 1977, IBM J. Res. Dev..

[32]  Sven Hartmann,et al.  Numerical constraints on XML data , 2010, Inf. Comput..

[33]  E. F. Codd,et al.  Extending the database relational model to capture more meaning , 1979, ACM Trans. Database Syst..

[34]  F. E..  A Relational Model of Data Large Shared Data Banks , 2000 .

[35]  Yehoshua Sagiv.  An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic , 1980, JACM.

[36]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[37]  Sven Hartmann,et al.  Characterising nested database dependencies by fragments of propositional logic , 2008, Ann. Pure Appl. Log..

[38]  Mark Levene,et al.  Database design for incomplete relations , 1999, TODS.

[39]  Marc Gyssens,et al.  The Structure of the Relational Database Model , 1989, EATCS Monographs on Theoretical Computer Science.

[40]  Catriel Beeri,et al.  On the menbership problem for functional and multivalued dependencies in relational databases , 1980, TODS.

[41]  Zvi Galil,et al.  An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database , 1982, JACM.

[42]  Jef Wijsen,et al.  Temporal FDs on complex objects , 1999, TODS.

[43]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.