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
528
Thorn,
Naish,
and
Ramamohanarao
reduce the number of buffers required for the "r" predicate, since the number
of slow bits of "r" has been fixed at zero.
The final bit to be chosen will be either Xj or Z
{
since both the sfb-vectors
<
Ύ
1
Υ
2
Χ
1
" and
ii
Y
l
Y
2
Z
l
99
would reduce the number of buffers required to
2
1
+ 2
2
+ 2° = 7 pages and 2° + 2
2
+ 2
1
= 7 pages respectively. Any more X,
Y, or Ζ bits will not further reduce the number of buffer pages required.
Some larger examples are given in Appendix 2. The algorithm guarantees
that at least one predicate will only need one buffer and produces an optimal
sfb-vector for all two-way joins. However
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