|
ABSTRACT
The algebras and query languages for nested relations defined thus far do not allow us to “flatten” a relation scheme by disregarding the internal representation of data. In real life, however, the degree in which the structure of certain information, such as addresses, phone numbers, etc., is taken into account depends on the particular application and may even vary in time. Therefore, an algebra is proposed that does allow us to simplify relations by disregarding the internal structure of a certain class of information. This algebra is based on a careful manipulation of attribute names. Furthermore, the key operator in this algebra, called “copying,” allows us to deal with various other common queries in a very uniform manner, provided these queries are interpreted as operations on classes of semantically equivalent relations rather than individual relations. Finally, it is shown that the proposed algebra is complete in the sense of Bancilhon and Paredaens.
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 BEERI, C. On the power of languages for the manipulation of complex objects. INRIA Tech. Rep. 846. INRIA, Paris, France, May 1988.
|
 |
2
|
|
| |
3
|
BANCILHON, F. On the completeness of query languages for relational data bases. In Proceedings of the 7th Symposium on Mathematical Foundations of Composition Science (Zakopane, Poland). In Lecture Notes in Computer Science, vol. 64, Springer-Verlag, Berlin, 1978, pp. 112-123.
|
| |
4
|
CHANDRA, A. K., AND HAREL, D. Computable queries for relational databases. J. Comput. Syst. Sci. 21, 2 (Oct. 1980), 156-178.
|
 |
5
|
|
| |
6
|
CODt~, E. F. Further normalizations of the relational data base model. In Data Base Systems, R. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 33-64.
|
| |
7
|
CODD, E.F. Relational completeness of database sublanguages. In Data Base Systems, Ft. Rustin, Ed. Prentice-Hall, Englewood Cliffs, N.J., 1972, pp. 65-98.
|
 |
8
|
|
| |
9
|
DESHPANDE, V., AND LARSON, P. An algebra for nested relational databases. Tech. Rep. CS-87- 65. Univ. of Waterloo, Waterloo, Ont., Canada, Dec. 1987.
|
| |
10
|
GYSSENS, M., AND VAN GUCHT, D. The powerset operator as an algebraic tool for understanding least fixpoint semantics in the context of nested relations. Tech. Rep. 233. Computer Science Department, Indiana Univ., Bloomington, Ind., Oct. 1987.
|
 |
11
|
|
 |
12
|
|
| |
13
|
|
 |
14
|
|
| |
15
|
|
| |
16
|
MAKINOUCHI, A. A consideration of normal form of not-necessarily-normalized relations in the relational data model. In Proceedings of the 3rd VLDB Conference (Tokyo), 1977, pp. 445'-453.
|
 |
17
|
|
| |
18
|
PAREDAENS, J. On the expressive power of the relational algebra. Inf. Proc. Lett. 7, 2 (Feb. 1978), 107-111.
|
| |
19
|
|
 |
20
|
|
| |
21
|
|
| |
22
|
|
| |
23
|
|
 |
24
|
|
| |
25
|
|
| |
26
|
THOMAS, S. J., AND FISCHER, P.C. Nested relational structures. In The Theory of Databases, P. C. Kanellakis, Ed. JAI Press, Greenwich, Conn., 1986, pp. 269-307.
|
| |
27
|
|
 |
28
|
|
| |
29
|
ZANIOLO, C. Database relations with null values. J. Comput. Syst. Sci. 28, 1 (Feb. 1984), 142-166.
|
REVIEW
"Jaroslav Pokorny : Reviewer"
The new version of the nested relational model introduced here
allows us to consider values corresponding to atomic attributes as
nonatomic. The approach is motivated by different user views of the
structure of data. Consequently, the authors
more...
|