The powerset algebra as a result of adding programming constructs to the nested relational algebra
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGMOD Record
- Vol. 17 (3) , 225-232
- https://doi.org/10.1145/971701.50230
Abstract
In this paper, we discuss augmentations of the nested relational algebra with programming constructs, such as while-loops and for-loops. We show that the algebras obtained in this way are equivalent to a slight extension of the powerset algebra, thus emphasizing both the strength and the naturalness of the powerset algebra as a tool to manipulate nested relations, and, at the same time, indicating more direct ways to implement this algebra.Keywords
This publication has 9 references indexed in Scilit:
- Possibilities and limitations of using flat operators in nested algebra expressionsPublished by Association for Computing Machinery (ACM) ,1988
- Extending relational algebra and relational calculus with set-valued attributes and aggregate functionsACM Transactions on Database Systems, 1987
- On the expressive power of the extended relational algebra for the unnormalized relational modelPublished by Association for Computing Machinery (ACM) ,1987
- Horn clause queries and generalizationsThe Journal of Logic Programming, 1985
- A new approach to database logicPublished by Association for Computing Machinery (ACM) ,1984
- Remarks on the algebra of non first normal form relationsPublished by Association for Computing Machinery (ACM) ,1982
- Universality of data retrieval languagesPublished by Association for Computing Machinery (ACM) ,1979
- A relational model of data for large shared data banksCommunications of the ACM, 1970
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955