The semijoin algebra and the guarded fragment

Simple item page
dc.creatorLeinders, Dirk
dc.creatorTyszkiewicz, Jerzy
dc.creatorBussche, Jan Van den
dc.date2004-07-02
dc.date.accessioned2026-07-07T03:21:31Z
dc.date.available2026-07-07T03:21:31Z
dc.descriptionThe semijoin algebra is the variant of the relational algebra obtained by replacing the join operator by the semijoin operator. We discuss some interesting connections between the semijoin algebra and the guarded fragment of first-order logic. We also provide an Ehrenfeucht-Fraisse game, characterizing the discerning power of the semijoin algebra. This game gives a method for showing that certain queries are not expressible in the semijoin algebra.
dc.description11 pages, 2 figures
dc.identifierhttps://arxiv.org/abs/cs/0407007
dc.identifierhttp://arxiv.org/abs/cs/0407007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32228
dc.subjectDatabases
dc.subjectLogic in Computer Science
dc.subjectH.2.3;F.4.1
dc.titleThe semijoin algebra and the guarded fragment
dc.typetext

Files

Collections

arXiv