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
Thorn, Naish, and Ramamohanarao
Introduction
The join operator is both a frequently used relational operator and an expensive
one in relational database systems. Several join algorithms have been discussed
in the recent literature, including Bratbergsengen [1984], DeWitt et al. [1984],
Jarke and Koch [1984], and Ullman [1985], for example, nested-loops, sort-
merge, and hash-join.
We propose another join algorithm, the super join algorithm. This algo-
rithm, based on multi-key hashing, partitions the join to enable efficient buffer
management. The superjoin algorithm is suitable for large relational databases
accessed from computers with larg ...
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