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
492
Bancilhon
and
Ramakrishnan
There are a total of
(h'
up>down
+ 1) steps. In addition, we set up D E
1
new
subqueries at Step i. In fact, we may set up new subqueries even when the pre-
vious steps generate no new paths, since this is done for i = 1 to h'
up
.
The paths with a segment of length i in up are computed by the following
join:
up. s
g.
down
The join at Step i is computed in 3 stages. For a given start node (in up),
we find all paths starting from one of its children and having a segment of
length i - 1 in up (and in down). We do this by simply using the paths we
found in Steps 1 through i
1 (i.e., in the partial results for s
g
compute ...
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