DocumentCode :
2984054
Title :
An extended recursive algebra for nested relations and its optimization
Author :
Rathakrishnan, Balaji ; Kim, Junguk L.
Author_Institution :
Dept. of Comput. Sci., Texas A&M Univ., College Station, TX, USA
fYear :
1993
fDate :
1-5 Nov 1993
Firstpage :
145
Lastpage :
151
Abstract :
This paper considers query optimization for nested relational databases based on a recursive algebra. A recursive algebra which has been proposed in the literature for nested relations has been extended to accommodate arbitrary algebraic expressions in any nested level of the query. This extended algebra can be used to conveniently express queries in two query languages proposed for the nested relational model. A semijoin based algebraic optimization strategy for queries expressible in this algebra is described, which is a recursive extension of an 1NF optimization technique with some modifications
Keywords :
algebra; database theory; optimisation; query languages; query processing; recursive functions; relational databases; 1NF optimization technique; arbitrary algebraic expressions; extended recursive algebra; nested relational databases; nested relations; query languages; query optimization; semijoin-based algebraic optimisation; Algebra; Computer science; Database languages; Information management; Noise measurement; Prototypes; Query processing; Relational databases;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Software and Applications Conference, 1993. COMPSAC 93. Proceedings., Seventeenth Annual International
Conference_Location :
Phoenix, AZ
Print_ISBN :
0-8186-4440-0
Type :
conf
DOI :
10.1109/CMPSAC.1993.404228
Filename :
404228
Link To Document :
بازگشت