Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/712
Title: Solving equations in the relational algebra
Authors: VAN DEN BUSSCHE, Jan 
Biskup, Joachim
Paredaens, Jan
Schwentick, Thomas
Issue Date: 2004
Publisher: SIAM
Source: SIAM Journal on Computing, 33(5). p. 1052-1066
Abstract: Enumerating all solutions of a relational algebra equation is a natural and powerful operation which, when added as a query language primitive to the nested relational algebra, yields a query language for nested relational databases, equivalent to the well-known powerset algebra. We study sparse equations, which are equations with at most polynomially many solutions. We look at their complexity and compare their expressive power with that of similar notions in the powerset algebra.
Document URI: http://hdl.handle.net/1942/712
ISSN: 0097-5397
e-ISSN: 1095-7111
DOI: 10.1137/S0097539701390859
ISI #: 000223259500003
Category: A1
Type: Journal Contribution
Validations: ecoom 2005
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
solving.pdf210.65 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

5
checked on Sep 3, 2020

WEB OF SCIENCETM
Citations

3
checked on May 13, 2022

Page view(s)

50
checked on May 17, 2022

Download(s)

82
checked on May 17, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.