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
13:
A
Superjoin
Algorithm
for
Deductive
Databases
533
The superjoin
can be
used
to
compute "parent(A,
B),
ancestor^B,
C)" and in-
sert
the
values
of A and C
into
the
4
* ancestor
{
+
j" relation
on
each iteration.
Dummy variables
can be
used
to
make insertion into
the
relation
and its use
(on
the
next iteration) efficient.
Analysis
In this section
we
analyze
the
performance
of the
superjoin.
We use a
similar
analysis
as
Bratbergsengen [1984]
and
assume there
are two
relations
("p" and
44
q")
and
only
one
join attribute.
The
following parameters
are
used
in the
analysis:
Ρ
=
size
of
relation
"p" in
pages
Q
=
size
of
relation
44
q" in
page ...
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