Affiliation:
1. Department of Mathematics and Statistics University of Houston-Downtown One Main Street Houston , TX 77002, USA
Abstract
Abstract
We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic of relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains.
Publisher
Oxford University Press (OUP)
Reference38 articles.
1. Theory of joins in relational databases;Aho;ACM Transactions on Database Systems,1979
2. Properties of acyclic database schemes, in Proceedings of the 13th annual ACM Symposium on Theory of Computing;Beeri;Milwaukee, May,1981
3. Bases for Boolean co-clones;Böhler;Information Processing Letters,2005