Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/712

Title: Solving equations in the relational algebra
Biskup, Joachim
Paredaens, Jan
Schwentick, Thomas
Issue Date: 2004
Publisher: SIAM
Citation: 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.
URI: http://hdl.handle.net/1942/712
DOI: 10.1137/S0097539701390859
ISI #: 000223259500003
ISSN: 0097-5397
Category: A1
Type: Journal Contribution
Validation: ecoom, 2005
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A210.65 kBAdobe PDF

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