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
487
before). However, each
arc is
generated
at
exactly
one
step. Hence,
the
num-
ber
of
successful firings
can be
computed
as
follows:
Firings
of Rl and R2:
(D)a(l)
+ D £ (i - 1) a(i)
i=2
Firings
of
R3: (E)gsum(E,h'
- 1)
And
the
total cost
is:
(E)gsum(E,h'
- 1) +
(D)a(l)
+ D £ (i - 1) a(i)
i=2
QSQ, Iterative As in the
previous
two
queries, QSQI improves
on
Naive
Evaluation
by
restricting itself
to the
subtree rooted
at
John.
At
Step
i, we
generate
all
arcs
of
length less than
or
equal
to 2
,_1
in
this subtree, generating
each
arc of
length
1,
1
1
times, with
a
duplication factor
D.
Using
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