skip to main content
10.1145/1807085.1807126acmconferencesArticle/Chapter ViewAbstractPublication PagespodsConference Proceedingsconference-collections
research-article

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

Published: 06 June 2010 Publication History

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.

References

[1]
M. Arenas and L. Libkin. A normal form for XML documents. ACM Trans. Database Syst., 29(1):195--232, 2004.
[2]
W. W. Armstrong. Dependency structures of database relationships. Information Processing, 74:580--583, 1974.
[3]
P. Atzeni and N. Morfuni. Functional dependencies and constraints on null values in database relations. Information and Control, 70(1):1--31, 1986.
[4]
C. Beeri. On the membership problem for functional and multivalued dependencies in relational databases. ACM Trans. Database Syst., 5(3):241--259, 1980.
[5]
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.
[6]
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.
[7]
J. Biskup. Inferences of multivalued dependencies in fixed and undetermined universes. Theor. Comput. Sci., 10(1):93--106, 1980.
[8]
J. Biskup and S. Link. Appropriate reasoning about data dependencies in fixed and undetermined universes. In FoIKS, pages 58--77, 2006.
[9]
M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. J. ACM, 56(3), 2009.
[10]
M. Cadoli and M. Schaerf. On the complexity of entailment in propositional multivalued logics. Ann. Math. Artif. Intell., 18(1):29--50, 1996.
[11]
E. F. Codd. A relational model of data for large shared data banks. Commun. ACM, 13(6):377--387, 1970.
[12]
E. F. Codd. Extending the database relational model to capture more meaning. ACM Trans. Database Syst., 4(4):397--434, 1979.
[13]
C. Delobel. Normalization and hierarchical dependencies in the relational data model. ACM Trans. Database Syst., 3(3):201--222, 1978.
[14]
C. Delobel and M. Adiba. Relational database systems. North Holland, 1985.
[15]
R. Fagin. Functional dependencies in a relational data base and propositional logic. IBM Journal of Research and Development, 21(6):543--544, 1977.
[16]
R. Fagin. Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst., 2(3):262--278, 1977.
[17]
R. Fagin, P. Kolaitis, R. Miller, and L. Popa. Data exchange: semantics and query answering. Theor. Comput. Sci., 336(1):89--124, 2005.
[18]
Z. Galil. An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM, 29(1):96--102, 1982.
[19]
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.
[20]
S. Hartmann and S. Link. Characterising nested database dependencies by fragments of propositional logic. Ann. Pure Appl. Logic, 152(1-3):84--106, 2008.
[21]
S. Hartmann and S. Link. Efficient reasoning about a robust XML key fragment. ACM Trans. Database Syst., 34(2), 2009.
[22]
S. Hartmann and S. Link. Numerical constraints on XML data. Inf. Comput., 208(5):521--544, 2010.
[23]
T. Imielinski and W. Lipski Jr. Incomplete information in relational databases. J. ACM, 31(4):761--791, 1984.
[24]
S. Kolahi. Dependency-preserving normalization of relational and XML data. J. Comput. Syst. Sci., 73(4):636--647, 2007.
[25]
M. Levene and G. Loizou. Axiomatisation of functional dependencies in incomplete relations. Theor. Comput. Sci., 206(1-2):283--300, 1998.
[26]
M. Levene and G. Loizou. Database design for incomplete relations. ACM Trans. Database Syst., 24(1):80--125, 1999.
[27]
H. Levesque. A knowledge-level account of abduction. In IJCAI, pages 1061--1067, 1989.
[28]
E. Lien. On the equivalence of database models. J. ACM, 29(2):333--362, 1982.
[29]
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.
[30]
S. Link. On the implication of multivalued dependencies in partial database relations. Int. J. Found. Comput. Sci., 19(3):691--715, 2008.
[31]
P. Marquis and N. Porquet. Resource-bounded paraconsistent inference. Ann. Math. Artif. Intell., 39:349--384, 2003.
[32]
J. Paredaens, P. De Bra, M. Gyssens, and D. Van Gucht. The Structure of the Relational Database Model. Springer, 1989.
[33]
G. Priest. Logic of paradox. Journal of Philosophical Logic, 8:219--241, 1979.
[34]
Y. Sagiv. An algorithm for inferring multivalued dependencies with an application to propositional logic. J. ACM, 27(2):250--262, 1980.
[35]
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.
[36]
M. Schaerf and M. Cadoli. Tractable reasoning via approximation. Artif. Intell., 74:249--310, 1995.
[37]
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.
[38]
M. Vardi. The complexity of relational query languages. In STOC, pages 137--146, 1982.
[39]
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.
[40]
G. Weddell. Reasoning about functional dependencies generalized for semantic data models. ACM Trans. Database Syst., 17(1):32--64, 1992.
[41]
J. Wijsen. Temporal FDs on Complex Objects. ACM Trans. Database Syst., 24(1):127--176, 1999.
[42]
M. Wu. The practical need for fourth normal form. In ACM SIGCSE, pages 19--23, 1992.
[43]
C. Zaniolo. Database relations with null values. J. Comput. Syst. Sci., 28(1):142--166, 1984.

Cited By

View all
  • (2023)Cardinality constraints and functional dependencies in SQLInformation Systems10.1016/j.is.2023.102208115:COnline publication date: 1-May-2023
  • (2023)Entity integrity management under data volume, variety and veracityKnowledge and Information Systems10.1007/s10115-022-01814-165:7(2895-2934)Online publication date: 25-Jan-2023
  • (2022)Incomplete Data and Data Dependencies in Relational DatabasesundefinedOnline publication date: 2-Mar-2022
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PODS '10: Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
June 2010
350 pages
ISBN:9781450300339
DOI:10.1145/1807085
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2010

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. axiomatization
  2. data dependency
  3. implication
  4. logic of paradox
  5. null value
  6. s-3 logic

Qualifiers

  • Research-article

Conference

SIGMOD/PODS '10
Sponsor:
SIGMOD/PODS '10: International Conference on Management of Data
June 6 - 11, 2010
Indiana, Indianapolis, USA

Acceptance Rates

PODS '10 Paper Acceptance Rate 27 of 113 submissions, 24%;
Overall Acceptance Rate 642 of 2,707 submissions, 24%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Cardinality constraints and functional dependencies in SQLInformation Systems10.1016/j.is.2023.102208115:COnline publication date: 1-May-2023
  • (2023)Entity integrity management under data volume, variety and veracityKnowledge and Information Systems10.1007/s10115-022-01814-165:7(2895-2934)Online publication date: 25-Jan-2023
  • (2022)Incomplete Data and Data Dependencies in Relational DatabasesundefinedOnline publication date: 2-Mar-2022
  • (2021)Possible Keys and Functional DependenciesJournal on Data Semantics10.1007/s13740-021-00135-w10:3-4(327-366)Online publication date: 14-Aug-2021
  • (2016)SQL Schema DesignProceedings of the 2016 International Conference on Management of Data10.1145/2882903.2915239(267-279)Online publication date: 26-Jun-2016
  • (2016)Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete DataDependence Logic10.1007/978-3-319-31803-5_9(183-217)Online publication date: 30-Jun-2016
  • (2013)Customized Policies for Handling Partial Information in Relational DatabasesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2012.9125:6(1254-1271)Online publication date: 1-Jun-2013
  • (2013)Reasoning about functional and full hierarchical dependencies over partial relationsInformation Sciences: an International Journal10.1016/j.ins.2013.01.009235(150-173)Online publication date: 1-Jun-2013
  • (2012)Armstrong databasesProceedings of the Eighth Asia-Pacific Conference on Conceptual Modelling - Volume 13010.5555/2523782.2523784(3-22)Online publication date: 31-Jan-2012
  • (2012)Foundations for a fourth normal form over SQL-Like databasesConceptual Modelling and Its Theoretical Foundations10.5555/2184207.2184215(85-100)Online publication date: 1-Jan-2012
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media