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 12: Performance Evaluation of Logic Programs 505
QSQR succeeds in restricting the set of relevant facts to the set of nodes
reachable from the query node even in the non-linear version of ancestor. It
does this at the cost of implementing the recursive control, which is a cost that
we do not understand at this stage. QSQI also succeeds in restricting the set of
relevant facts but performs a great deal of duplicate computation. The Magic
Sets algorithm uses the entire parent relation for the set of relevant facts and so
degenerates to Semi-Naive. APEX, for reasons explained below, also uses a
much larger set of relevant facts. So, althoug ...
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