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.KeywordsOutput PortDependency GraphRelational AlgebraBibliographic NoteDatalog ProgramThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
