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
466 Bancilhon and Ramakrishnan
sg^(X,Y) :- p(X,XP),p(Y,YP),magic^(Y),sg^(YP,XP).
sg*(X,X) i-magic*(X).
sg^(X,X) :-magic*(X).
query.f(X) :- sg*(a,X).
The idea of the magic sets strategy was presented in Bancilhon et al.
[1986b] and the precise algorithm is described in Bancilhon et al. [1986a]. To
our knowledge, the strategy is not implemented.
Counting
and Reverse
Counting
Counting and Reverse Counting are derived from the magic sets optimization
strategy. They apply under two conditions: (i) the data is acyclic, and (ii) there
is at most one recursive rule for each predicate, and it is linear. We first
describe counting using the
*
'typical ...
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