On the complexity of division and set joins in the relational algebra

Authors:
Dirk Leinders;Jan Van den Bussche
Affiliations:
Limburgs Universitair Centrum;Limburgs Universitair Centrum
Venue:
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Year:
2005

Citing 16
Cited 3

Fast algorithms for universal quantification in large databases

ACM Transactions on Database Systems (TODS)
Providing better support for a class of decision support queries

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Using Semi-Joins to Solve Relational Queries

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Datalog LITE: a deductive query language with linear time model checking

ACM Transactions on Computational Logic (TOCL)
Back and forth between guarded and modal logics

ACM Transactions on Computational Logic (TOCL)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Data Structures and Algorithms

Data Structures and Algorithms
Query evaluation via tree-decompositions

Journal of the ACM (JACM)
Relational Division: Four Algorithms and Their Performance

Proceedings of the Fifth International Conference on Data Engineering
Set Containment Joins: The Good, The Bad and The Ugly

VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Deciding the guarded fragments by resolution

Journal of Symbolic Computation
Efficient processing of joins on set-valued attributes

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Efficient set joins on similarity predicates

SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
On the expressive power of semijoin queries

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing

Database query processing using finite cursor machines

ICDT'07 Proceedings of the 11th international conference on Database Theory
The semijoin algebra

FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Efficient implementation of generalized quantification in relational query languages

Proceedings of the VLDB Endowment

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that any expression of the relational division operator in the relational algebra with union, difference, projection, selection, and equijoins, must produce intermediate results of quadratic size. To prove this result, we show a dichotomy theorem about intermediate sizes of relational algebra expressions (they are either all linear, or at least one is quadratic); we link linear relational algebra expressions to expressions using only semijoins instead of joins; and we link these semijoin algebra expressions to the guarded fragment of first-order logic.