On the expressive power of semijoin queries
| dc.creator | Leinders, Dirk | |
| dc.creator | Tyszkiewicz, Jerzy | |
| dc.creator | Bussche, Jan Van den | |
| dc.date | 2003-08-06 | |
| dc.date | 2004-03-03 | |
| dc.date.accessioned | 2026-07-07T03:20:12Z | |
| dc.date.available | 2026-07-07T03:20:12Z | |
| dc.description | The semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We provide an Ehrenfeucht-Fraissé 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. | |
| dc.description | 9 pages, to appear in Information Processing Letters; added results that more clearly delineate the expressive power of SA, added a section that discusses the impact of order on the expressive power of SA, deemphasized the discussion on the relationship with GF | |
| dc.identifier | https://arxiv.org/abs/cs/0308014 | |
| dc.identifier | http://arxiv.org/abs/cs/0308014 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31743 | |
| dc.subject | Databases | |
| dc.subject | Logic in Computer Science | |
| dc.subject | H.2.3; F.4.1 | |
| dc.title | On the expressive power of semijoin queries | |
| dc.type | text |