Skip to Main Content
Foundations of Deductive Databases and Logic Programming
book

Foundations of Deductive Databases and Logic Programming

by Jack Minker
May 2014
Intermediate to advanced content levelIntermediate to advanced
752 pages
35h 3m
English
Morgan Kaufmann
Content preview from Foundations of Deductive Databases and Logic Programming
Chapter 17: Optimizing Datalog Programs 669
Optimizing
Recursive
Programs
In this paper we consider a particular type of optimization, namely, removing
redundant atoms from the body of a rule and removing redundant rules from a
program. This optimization is useful since it reduces the number of joins
needed to compute the output. The problem of optimizing nonrecursive
programs has been solved, both for the case of single-rule programs (Aho,
Sagiv, and Ullman [1979], and Chandra and Merlin [1976]) and for the case
of programs with many rules (Sagiv and Yannakakis [1980]). Essentially, it
has been shown that a program consisting of nonrecursiv ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Concepts and Semantics of Programming Languages 1

Concepts and Semantics of Programming Languages 1

Therese Hardin, Mathieu Jaume, Francois Pessaux, Veronique Viguie Donzeau-Gouge
Handbook of Constraint Programming

Handbook of Constraint Programming

Francesca Rossi, Peter van Beek, Toby Walsh

Publisher Resources

ISBN: 9781483221120