Abstract
In literature on query optimization the normal form for relational algebra expressions consisting of Projection, Selection and Join, is well known. In this paper we extend this normal form with Calculation and Union and define a corresponding language UPCSJL. In addition we show how the normal form can be used for query optimization.
Cite
CITATION STYLE
van Denneheuvel, S., Kwast, K., Renardel De Lavalette, G. R., & Spaan, E. (1991). Query optimization using rewrite rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 488 LNCS, pp. 252–263). Springer Verlag. https://doi.org/10.1007/3-540-53904-2_101
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
