Skip to main content
SpringerLink
Log in

Query optimization using rewrite rules

  • Conference paper
  • First Online:
Rewriting Techniques and Applications (RTA 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 488))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. van Denneheuvel, S., Kwast K. & Renardel de Lavalette G. R., A normal form for PCSJ expressions, Computing Science in the Netherlands, Nov 1990, 109–120, (1990).

    Google Scholar 

  2. Larson, P.A., Yang, H.Z., Computing Queries from Derived Relations, Proc. of the 11th Intl. Conf. on VLDB, 259–269, (1985).

    Google Scholar 

  3. Ullman, J.D., Principles of Data and Knowledge — Base Systems, Volume II: The New Technologies, Computer Science Press, (1989).

    Google Scholar 

  4. van Emde Boas, P., RL, a Language for Enhanced Rule Bases Database Processing, Working Document, Rep IBM Research, RJ 4869 (51299), (1986).

    Google Scholar 

  5. van Emde Boas, P., A semantical model for the integration and modularization of rules, Proceedings MFCS 12, Bratislava, LNCS 233, 78–92, (1986).

    Google Scholar 

  6. van Emde Boas, H. & van Emde Boas, P., Storing and Evaluating Horn-Clause Rules in a Relational Database, IBM J. Res. Develop. 30 (1), 80–92, (1986).

    Google Scholar 

  7. Yang, H. Z., Larson, P. A., Query Transformations for PSJ-queries, Proc. of the 13th Int. Conf. on VLDB, Brighton, 245–254, (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Computer Science, Univ. of Amsterdam (UVA), The Netherlands

    Sieger van Denneheuvel, Karen Kwast & Edith Spaan

  2. Applied Logic Group, Dept. of Philosophy, Univ. of Utrecht (RUU), The Netherlands

    Gerard R. Renardel de Lavalette

Authors
  1. Sieger van Denneheuvel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karen Kwast
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerard R. Renardel de Lavalette
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Edith Spaan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ronald V. Book

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van Denneheuvel, S., Kwast, K., Renardel de Lavalette, G.R., Spaan, E. (1991). Query optimization using rewrite rules. In: Book, R.V. (eds) Rewriting Techniques and Applications. RTA 1991. Lecture Notes in Computer Science, vol 488. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53904-2_101

Download citation

  • DOI: https://doi.org/10.1007/3-540-53904-2_101

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53904-9

  • Online ISBN: 978-3-540-46383-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation