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 12: Performance Evaluation of Logic Programs 509
for instance, the fact that Semi-Naive performs as well as any other strategy
when computing the entire transitive closure of a relation (Bancilhon [1986]).
Further, our data contains no cycles or shortcuts. This is an important limita-
tion since it favors some of the specialized strategies. For instance, there are
cases where Counting performs worse than Magic Sets (Bancilhon et al.
[1986a]). This is not shown by our results since these cases involve shortcuts
in the data.
Acknowledgments
We thank the anonymous referees for numerous comments which improved the
technical content and presentatio ...
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