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 | Size | Format | |
---|---|---|---|---|
solving.pdf | 210.65 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
5
checked on Sep 3, 2020
WEB OF SCIENCETM
Citations
4
checked on Sep 28, 2024
Page view(s)
66
checked on Jun 14, 2023
Download(s)
126
checked on Jun 14, 2023
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.