Abstract
In this chapter we introduce a number of rewriting methods for Datalog programs. Section 10.1 presents rewriting methods that apply directly to Datalog programs: the Magic Sets, Counting, Static Filtering and Semi-naive Evaluation by Rewriting. Section 10.2 presents a structured approach to the optimization of algebraic systems; it consists of a number of preliminary steps, after which the optimization methods of reduction of variables and reduction of constants are applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ceri, S., Gottlob, G., Tanca, L. (1990). Rewriting Methods. In: Logic Programming and Databases. Surveys in Computer Science. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-83952-8_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-83952-8_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-83954-2
Online ISBN: 978-3-642-83952-8
eBook Packages: Springer Book Archive