| On Roth, Korth, and Silberschatz's extended algebra and calculus for nested relational databases |
| Full text |
Pdf
(525 KB)
|
| Source
|
ACM Transactions on Database Systems (TODS)
archive
Volume 17 , Issue 2 (June 1992)
table of contents
Pages: 374 - 383
Year of Publication: 1992
ISSN:0362-5915
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 28, Citation Count: 3
|
|
|
ABSTRACT
We discuss the issues encountered in the extended algebra and calculus languages for nested relations defined by Roth, Korth, and Silberschatz.[4]. Their equivalence proof between algebra and calculus fails because of the keying problems and the use of extended set operations. Extended set operations also have unintended side effects. Furthermore, their calculus seems to allow the generation of power sets, thus making it more powerful than their algebra.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
GARNETT, L., AND TANSEL, A.U. Equivalence of relational algebra and calculus languages for nested relations. Comput. Math. Appl. 23, 10 (1992), 3-25.
|
| |
2
|
|
| |
3
|
|
 |
4
|
|
| |
5
|
TASSEL, A. U., AND GARN~TT, L. Temporal relational data model. Tech. Rep., Baruch College-CUNY, New York, Mar. 1991.
|
| |
6
|
|
REVIEW
"Don Goelman : Reviewer"
The setting for this paper is relational databases that are not in
first normal form (1NF), that is, those whose component relations have
fields that are not necessarily atomic. Although Codd foresaw their
potential [1], most interest in non-1
more...
|