On the expressive power of semijoin queries

Authors:
Dirk Leinders;Jerzy Tyszkiewicz;Jan Van den Bussche
Affiliations:
Limburgs Universitair Centrum, Universitaire Campus, 3590 Diepenbeek, Belgium;Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warszawa, Poland;Limburgs Universitair Centrum, Universitaire Campus, 3590 Diepenbeek, Belgium
Venue:
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Year:
2004

Citing 4
Cited 4

Using Semi-Joins to Solve Relational Queries

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

Journal of the ACM (JACM)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Database Systems: The Complete Book

Database Systems: The Complete Book

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

Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The Semijoin Algebra and the Guarded Fragment

Journal of Logic, Language and Information
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We provide an Ehrenfeucht-Fraïssé game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that queries are not expressible in the semijoin algebra.