Abstract
We investigate the implication problem for independence atoms \(X \bot Y\) of disjoint attribute sets X and Y on database schemata. A relation satisfies \(X \bot Y\) if for every X-value and every Y-value that occurs in the relation there is some tuple in the relation in which the X-value occurs together with the Y-value. We establish an axiomatization by a finite set of Horn rules, and derive an algorithm for deciding the implication problem in low-degree polynomial time in the input. We show how to construct Armstrong relations which satisfy an arbitrarily given set of independence atoms and violate every independence atom not implied by the given set. Our results establish independence atoms as an efficient subclass of embedded multivalued data dependencies which are not axiomatizable by a finite set of Horn rules, and whose implication problem is undecidable.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Beeri, C., Fagin, R., Howard, J.H.: A complete axiomatization for functional and multivalued dependencies in database relations. In: SIGMOD Conference, pp. 47–61. ACM (1977)
Dawid, A.P.: Conditional independence in statistical theory. Journal of the Royal Statistical Society. Series B (Methodological) 41(1), 1–31 (1979)
Fagin, R.: Multivalued dependencies and a new normal form for relational databases. ACM Trans. Database Syst. 2(3), 262–278 (1977)
Fagin, R.: Horn clauses and database dependencies. J. ACM 29(4), 952–985 (1982)
Galil, Z.: An almost linear-time algorithm for computing a dependency basis in a relational database. J. ACM 29(1), 96–102 (1982)
Geiger, D., Pearl, J.: Logical and algorithmic properties of conditional independence and graphical models. The Annals of Statistics 21(4), 2001–2021 (1993)
Geiger, D., Paz, A., Pearl, J.: Axioms and algorithms for inferences involving probabilistic independence. Inf. Comput. 91(1), 128–141 (1991)
Grädel, E., Väänänen, J.A.: Dependence and independence. Studia Logica 101(2), 399–410 (2013)
Halpern, J.: Reasoning about uncertainty. MIT Press (2005)
Hartmann, S., Link, S.: The implication problem of data dependencies over SQL table definitions. ACM Trans. Datab. Syst. 37(2), 13.1–13.52 (2012)
Herrmann, C.: On the undecidability of implications between embedded multivalued database dependencies. Inf. Comput. 204(12), 1847–1851 (2006)
Langeveldt, W., Link, S.: Empirical evidence for the usefulness of Armstrong relations on the acquisition of meaningful FDs. Inf. Syst. 35(3), 352–374 (2010)
More, S.M., Naumov, P., Sapp, B.: Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence. In: CSL, vol. 12, pp. 443–457 (2011)
Naumov, P.: Independence in information spaces. Studia Logica 100(5), 953–973 (2012)
Paredaens, J.: The interaction of integrity constraints in an information system. J. Comput. Syst. Sci. 20(3), 310–329 (1980)
Parker Jr., D., Parsaye-Ghomi, K.: Inferences involving embedded multivalued dependencies and transitive dependencies. In: SIGMOD Conference, pp. 52–57 (1980)
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann (1988)
Rissanen, J.: Independent components of relations. ACM Trans. Database Syst. 2(4), 317–325 (1977)
Sagiv, Y., Delobel, C., Parker Jr., D., Fagin, R.: An equivalence between relational database dependencies and a fragment of propositional logic. J. ACM 28(3), 435–453 (1981)
Sagiv, Y., Walecka, S.F.: Subset dependencies and a completeness result for a subclass of embedded multivalued dependencies. J. ACM 29(1), 103–117 (1982)
Studený, M.: Conditional independence relations have no finite complete characterization. In: Transactions of the 11th Prague Conference on Information Theory, pp. 377–396. Kluwer (1992)
Thalheim, B.: Dependencies in relational databases. Teubner (1991)
van der Waerden, B.L.: Moderne Algebra. J. Springer, Berlin (1940)
Whitney, H.: On the Abstract Properties of Linear Dependence. Amer. J. Math. 57(3), 509–533 (1935)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kontinen, J., Link, S., Väänänen, J. (2013). Independence in Database Relations. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds) Logic, Language, Information, and Computation. WoLLIC 2013. Lecture Notes in Computer Science, vol 8071. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39992-3_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-39992-3_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39991-6
Online ISBN: 978-3-642-39992-3
eBook Packages: Computer ScienceComputer Science (R0)