Cylindric structures and dependencies in relational databases

Abstract In this paper, we explore the precise connection between dependencies in relational databases and variants of cylindric algebras, and apply recent algebraic results to problems of axiomatizing dependencies. First, we will consider project-join dependencies and the corresponding class of (representable) cylindric semilattices. Since representable cylindric semilattices have a non-finitely axiomatizable quasi-equational theory, there is no finite axiomatization for n -dimensional unrestricted project-join dependencies. Then we will look at Cosmadakis (in: A.K. Chandra (Ed.), Proc. 28th Annual Symp. on Foundations of Computer Science, IEEE Computer Society Press, Los Angeles, CA, 1987, pp. 411–420) who introduces cylindric dependencies, and makes several claims regarding the structural properties of these dependencies. Using the above-mentioned precise connection, we show that recent algebraic investigations of cylindric lattices provide counterexamples to Cosmadaki's claim that cylindric dependencies are finitely (schema) axiomatizable.

[1]  Alfred V. Aho,et al.  Equivalences Among Relational Expressions , 1979, SIAM J. Comput..

[2]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[3]  Hajnal Andréka,et al.  Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations , 1997, Ann. Pure Appl. Log..

[4]  Tomasz Imielinski,et al.  The Relational Model of Data and Cylindric Algebras , 1984, J. Comput. Syst. Sci..

[5]  Augustus de Morgan,et al.  On the Syllogism, No. IV., and on the Logic of Relations , 1864 .

[6]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[7]  Ivo Düntsch,et al.  Algebraic Aspects of Attribute Dependencies in Information Systems , 1997, Fundam. Informaticae.

[8]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[9]  E. Schröder.  Vorlesungen uber die Algebra der Logik , 1967 .

[10]  Miroslav Novotný,et al.  Dependence Spaces of Information Systems , 1998 .

[11]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[12]  A. Tarski,et al.  A Formalization Of Set Theory Without Variables , 1987 .

[13]  Gail S. Huston,et al.  Table errata: “On the syllogism (IV) and on the logic of relations” (Trans. Cambridge Philos. Soc. 10 (1864), 331–358), by A. De Morgan , 1974 .

[14]  E. F. Codd,et al.  A relational model of data for large shared data banks , 1970, CACM.

[15]  Mihalis Yannakakis,et al.  Algebraic dependencies , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[16]  Michael Anshel,et al.  Mathematics of Information Processing , 1986 .

[17]  A. Tarski,et al.  Cylindric Algebras. Part II , 1988 .

[18]  Ronald Fagin,et al.  The theory of data dependencies - a survey , 1984 .

[19]  P. Heath,et al.  On the Syllogism and Other Logical Writings. , 1966 .

[20]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[21]  A note on cylindric lattices , 1993 .

[22]  Szabolcs Mikulás,et al.  Axiomatizability of reducts of algebras of relations , 2000 .

[23]  C. Chree,et al.  Transactions of the Cambridge Philosophical Society , 1889 .

[24]  Algebraic logic , 1985, Problem books in mathematics.

[25]  Miroslav Novotný,et al.  Applications of Dependence Spaces , 1998 .

[26]  Stavros S. Cosmadakis.  Database theory and cylindric lattices , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[27]  Hajnal Andréka,et al.  Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability , 1997, Ann. Pure Appl. Log..