Please use this identifier to cite or link to this item:
|Title:||The powerset algebra as a natural tool to handle nested database relations||Authors:||Gyssens, Marc
Van Gucht, Dirk
|Issue Date:||1992||Source:||JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 45 (1), p. 76-103||Abstract:||The nested relational algebra is often inadequate as a tool to handle nested relations, since several important queries, such as transitive closure, cannot expressed by it. On the other hand, the powerset algebra does allow the expression of transitive closure, but in a too expensive way. Therefore, we consider various other extensions to the nested algebra, such as least fixpoint and programming constructs, and show the query languages obtained in this way to be equivalent to (a slight extension of) the powerset algebra, thus both emphasizing the naturalness and strength of the latter as a tool to manipulate nested relations, and, at the same time, indicating better ways to implement the powerset algebra.||Document URI:||http://hdl.handle.net/1942/13458||ISSN:||0022-0000||e-ISSN:||1090-2724||DOI:||10.1016/0022-0000(92)90041-G||Rights:||Copyright © 1992 Published by Elsevier Inc.||Type:||Journal Contribution|
|Appears in Collections:||Research publications|
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.