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
541
(7)
XPreds = [[Χ, Y, Χ], [Y, X, Z] ] % note repeated
variable
NBits = [[3, 1, 4], [2, 3, 5]]
Sfb = [XI, X2, X3, Yl, Y2, Zl, Z2, Z3, Z4, Z5]
Cost = 3
References
1.
Aho, Α. V. and Ullman, J. D. [1979] Optimal Partial-Match Retrieval When
Fields Are Independently Specified, ACM Transactions on Database Systems
4(2):168-179.
2.
Balbin, I. and Ramamohanarao, K. [1986] A Differential Approach to Query Op-
timisation in Recursive Deductive Databases, Technical Report 86/7, Department
of Computer Science, University of Melbourne.
3.
Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. D. [1985 ...
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