ACM Home Page
Please provide us with feedback. Feedback
Converting nested algebra expressions into flat algebra expressions
Full text PdfPdf (1.53 MB)
Source ACM Transactions on Database Systems (TODS) archive
Volume 17 ,  Issue 1  (March 1992) table of contents
Pages: 65 - 93  
Year of Publication: 1992
ISSN:0362-5915
Authors
Jan Paredaens  Univ. of Antwerp, Antwerp, Belgium
Dirk Van Gucht  Indiana Univ., Bloomington
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 37,   Citation Count: 15
Additional Information:

abstract   references   cited by   index terms   review   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/128765.128768
What is a DOI?

ABSTRACT

Nested relations generalize ordinary flat relations by allowing tuple values to be either atomic or set valued. The nested algebra is a generalization of the flat relational algebra to manipulate nested relations. In this paper we study the expressive power of the nested algebra relative to its operation on flat relational databases. We show that the flat relational algebra is rich enough to extract the same “flat information” from a flat database as the nested algebra does. Theoretically, this result implies that recursive queries such as the transitive closure of a binary relation cannot be expressed in the nested algebra. Practically, this result is relevant to (flat) relational query optimization.


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
ABITEBOUL, S., AND BEEm, S. On the power of languages for the manipulation of complex objects. INRIA Tech. Rep. 846. 1988.
 
2
3
 
4
5
6
 
7
 
8
9
 
10
 
11
CODD, E. F. Relational completeness of database sublanguages. In Database Systems, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J, 1972, pp. 65-98.
12
 
13
14
 
15
 
16
DE$HPANDE, A., AND VAN GUCHT, D. A storage structure for unnormalized relations. In Proceedings of the GI Conference on Database Systems for Office Automation, Eng~neering and Scientific Applications (Apr. 1987, Darmstadt, Germany) Inf Fachber~chte 136 (1987), 481-486.
 
17
 
18
DES~PANDE, V., AND LARSON, P. A. An algebra for nested relatmns. Res. Rep CS-87-65, Dept. of Computer Science, Univ. of Waterloo, Ontario, 1987.
19
 
20
21
 
22
HOUBEN, G., AND PAREDAENS, J. The R2-algebra: An extension of an algebra for nested relatmns. Tech. Rep., Computer Science Dept., Techmcal Univ., Eindhoven, The Netherlands, 1987.
23
24
 
25
 
26
 
27
 
28
 
29
MAKINOUCm, A. A consideration of normal form of not-necessarily-normalized relations in the relational data model. In Proceedings of the 3rd VLDB (Oct. 1977, Tokyo). VLDB Endowment, 1977, pp. 447-453.
 
30
31
 
32
33
 
34
 
35
 
36
37
 
38
 
39
 
40
 
41
 
42
 
43
THOMAS, S. J., AND F~SCHER, P.C. Nested relational structures. In Advances in Computing Research III, The Theory of Databases~ P. C. Kanellakis, Ed. JAI Press, Greenwich, Conn., 1986, pp. 269-307.
 
44

CITED BY  15


REVIEW

"Ferdi W. J. Put : Reviewer"

Nested relations can be obtained by removing the first normal form assumption in the relational model. As a consequence, tuple values can be either atomic or set-valued. During the 1980s, a lot of research was conducted on nested r  more...

Collaborative Colleagues:
Jan Paredaens: colleagues
Dirk Van Gucht: colleagues