
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 ...