On the complexity of division and set joins in the relational algebra
type: Item
instance of: scholarly article
title: On the complexity of division and set joins in the relational algebra
zbMATH Open document ID: 1115.68066
author: Dirk Leinders
author: Jan Van den Bussche
published in: Journal of Computer and System Sciences
publication date: 2007-05-23T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/954
Mathematics Subject Classification ID: 68P15
zbMATH DE Number: 5156646
zbMATH Keywords: database
zbMATH Keywords: relational algebra
zbMATH Keywords: semijoin algebra
zbMATH Keywords: complexity
MaRDI profile type: Publication
OpenAlex ID: W2082271602
cites work: Q4864249
cites work: Q3948568
cites work: Modal languages and bounded fragments of predicate logic
cites work: On the Desirability of Acyclic Database Schemes
cites work: Using Semi-Joins to Solve Relational Queries
cites work: Power of Natural Semijoins
cites work: Deciding the guarded fragments by resolution
cites work: On the Restraining Power of Guards
cites work: Back and forth between guarded and modal logics
cites work: The semijoin algebra and the guarded fragment
DOI: 10.1016/J.JCSS.2006.10.011
description: scientific article; zbMATH DE number 5156646