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 663
the presence of constraints, but they assumed that both rules and constraints
are nonrecursive. An interesting open question is whether our proof procedure
can be used in order to extend the results of Chakravarthy et al. [1986,1988]
to recursive rules and constraints. Other works on semantic query optimization
are those of Finger [1986] and of King [1981].
Naughton [1986] has developed a method for optimizing Datalog programs
by moving atoms from a recursive rule to nonrecursive rules (the method may
create new nonrecursive rules). The atoms that are moved to nonrecursive
rules may not be redundan ...
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