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

Authors:
Dirk Leinders;Jan Van den Bussche
Affiliations:
Hasselt University and Transnational University of Limburg, Agoralaan, Gebouw D, 3590 Diepenbeek, Belgium;Hasselt University and Transnational University of Limburg, Agoralaan, Gebouw D, 3590 Diepenbeek, Belgium
Venue:
Journal of Computer and System Sciences
Year:
2007

Citing 15
Cited 5

Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
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)
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
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
The Semijoin Algebra and the Guarded Fragment

Journal of Logic, Language and Information

Towards a theory of search queries

Proceedings of the 12th International Conference on Database Theory
SQL query space and time complexity estimation for multidimensional queries

International Journal of Intelligent Information and Database Systems
Towards a theory of search queries

ACM Transactions on Database Systems (TODS)
Database theory: query languages

Algorithms and theory of computation handbook
Efficient processing of containment queries on nested sets

Proceedings of the 16th International Conference on Extending Database Technology

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, constant-tagging, and joins, 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), and we link linear relational algebra expressions to expressions using only semijoins instead of joins.