Sven Hartmann
Sebastian Link
ABSTRACT
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.
- M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. Database Syst., 29(1):195--232, 2004. Google Scholar
Digital Library
- W. W. Armstrong. Dependency structures of database relationships. Information Processing, 74:580--583, 1974.Google Scholar
- P. Atzeni and N. Morfuni. Functional dependencies and constraints on null values in database relations. Information and Control, 70(1):1--31, 1986. Google ScholarDigital Library
- C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Database Syst., 5(3):241--259, 1980. Google ScholarDigital Library
- C. Beeri and P. Bernstein. Computational problems related to the design of normal form relational schemas. ACM Trans. Database Syst., 4(1):30--59, 1979. Google ScholarDigital Library
- C. Beeri, R. Fagin, and J. H. Howard. A complete axiomatization for functional and multivalued dependencies in database relations. In SIGMOD, pages 47--61. ACM, 1977. Google ScholarDigital Library
- J. Biskup. Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci., 10(1):93--106, 1980.Google ScholarCross Ref
- J. Biskup and S. Link. Appropriate reasoning about data dependencies in fixed and undetermined universes. In FoIKS, pages 58--77, 2006. Google ScholarDigital Library
- M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009. Google ScholarDigital Library
- M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalued logics. Ann. Math. Artif. Intell., 18(1):29--50, 1996.Google ScholarCross Ref
- E. F. Codd. A relational model of data for large shared data banks. Commun. ACM, 13(6):377--387, 1970. Google ScholarDigital Library
- E. F. Codd. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 4(4):397--434, 1979. Google ScholarDigital Library
- C. Delobel. Normalization and hierarchical dependencies in the relational data model. ACM Trans. Database Syst., 3(3):201--222, 1978. Google ScholarDigital Library
- C. Delobel and M. Adiba. Relational database systems. North Holland, 1985. Google ScholarDigital Library
- R. Fagin. Functional dependencies in a relational data base and propositional logic. IBM Journal of Research and Development, 21(6):543--544, 1977. Google ScholarDigital Library
- R. Fagin. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst., 2(3):262--278, 1977. Google ScholarDigital Library
- R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005. Google ScholarCross Ref
- Z. Galil. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM, 29(1):96--102, 1982. Google ScholarDigital Library
- K. Hagihara, M. Ito, K. Taniguchi, and T. Kasami. Decision problems for multivalued dependencies in relational databases. SIAM J. Comput., 8(2):247--264, 1979.Google ScholarDigital Library
- S. Hartmann and S. Link. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic, 152(1-3):84--106, 2008.Google ScholarCross Ref
- S. Hartmann and S. Link. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst., 34(2), 2009. Google ScholarDigital Library
- S. Hartmann and S. Link. Numerical constraints on XML data. Inf. Comput., 208(5):521--544, 2010. Google ScholarDigital Library
- T. Imielinski and W. Lipski Jr. Incomplete information in relational databases. J. ACM, 31(4):761--791, 1984. Google ScholarDigital Library
- S. Kolahi. Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci., 73(4):636--647, 2007. Google ScholarDigital Library
- M. Levene and G. Loizou. Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci., 206(1-2):283--300, 1998. Google ScholarDigital Library
- M. Levene and G. Loizou. Database design for incomplete relations. ACM Trans. Database Syst., 24(1):80--125, 1999. Google ScholarDigital Library
- H. Levesque. A knowledge-level account of abduction. In IJCAI, pages 1061--1067, 1989. Google ScholarDigital Library
- E. Lien. On the equivalence of database models. J. ACM, 29(2):333--362, 1982. Google ScholarDigital Library
- W.-D. Langeveldt and S. Link. Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependencies. Inf. Syst., 35(5):352--374, 2010. Google ScholarDigital Library
- S. Link. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci., 19(3):691--715, 2008.Google ScholarCross Ref
- P. Marquis and N. Porquet. Resource-bounded paraconsistent inference. Ann. Math. Artif. Intell., 39:349--384, 2003. Google ScholarDigital Library
- J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht. The Structure of the Relational Database Model. Springer, 1989. Google ScholarCross Ref
- G. Priest. Logic of paradox. Journal of Philosophical Logic, 8:219--241, 1979.Google ScholarCross Ref
- Y. Sagiv. An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM, 27(2):250--262, 1980. Google ScholarDigital Library
- Y. Sagiv, C. Delobel, D. S. Parker Jr., and R. Fagin. An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM, 28(3):435--453, 1981. Google ScholarDigital Library
- M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artif. Intell., 74:249--310, 1995. Google ScholarDigital Library
- D. Toman and G. Weddell. On keys and functional dependencies as first-class citizens in description logics. J. Autom. Reasoning, 40(2-3):117--132, 2008. Google ScholarDigital Library
- M. Vardi. The complexity of relational query languages. In STOC, pages 137--146, 1982. Google ScholarDigital Library
- M. Vincent, J. Liu, and C. Liu. Strong functional dependencies and their application to normal forms in XML. ACM Trans. Database Syst., 29(3):445--462, 2004. Google ScholarDigital Library
- G. Weddell. Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Database Syst., 17(1):32--64, 1992. Google ScholarDigital Library
- J. Wijsen. Temporal FDs on Complex Objects. ACM Trans. Database Syst., 24(1):127--176, 1999. Google ScholarDigital Library
- M. Wu. The practical need for fourth normal form. In ACM SIGCSE, pages 19--23, 1992. Google ScholarDigital Library
- C. Zaniolo. Database relations with null values. J. Comput. Syst. Sci., 28(1):142--166, 1984.Google ScholarCross Ref
Index Terms
- When data dependencies over SQL tables meet the logics of paradox and S-3
Recommendations
The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations
We investigate the implication problem for classes of data dependencies over SQL table definitions. Under Zaniolo's “no information” interpretation of null markers we establish an axiomatization and algorithms to decide the implication problem for the ...
Interpolation Methods for Dunn Logics and Their Extensions
The semantic valuations of classical logic, strong Kleene logic, the logic of paradox and the logic of first-degree entailment, all respect the Dunn conditions: we call them Dunn logics. In this paper, we study the interpolation properties of the Dunn ...
On Logic of Paradox
ISMVL '95: Proceedings of the 25th International Symposium on Multiple-Valued LogicAbstract: G. Priest introduced nonmonotonicity into a paraconsistent logic, so-called logic of paradox LP, that yields a solution to the weakness of paraconsistent logic. The resulting logic (of minimal parades) LP/sub m/ is nonmonotonic in the sense ...
Comments