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
524
Thorn,
Naish,
and
Ramamohanarao
and try to find tuples from the second predicate that match. Since "yO" hashes
to
"...00,"
only pages 000 and 010 from "q" would need to be read.
However, as there are no matching tuples, PROLOG would proceed with the
second solution from the first page of "p" in a similar fashion. Thus, the
second solution
p(
M
x2",
"y2")
would join with the tuples
q("y2
M
,
"z2")
q("y2",
"zl")
This would require reading pages 001 and 011 from "q" since "y2" hashes to
"...10."
After exhausting all the tuples in the first page of "p," PROLOG
would proceed in a similar fashion with subsequent pages of "p."
This scheme for implementin ...
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