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 7: Foundations of Semantic Query Optimization 253
must hold also. Let F' be a replacement of F as performed in Step 2. If F'
holds in DB* then F must hold and so G must hold in DB*. If DB does not
satisfy G F, then there must be a counterexample, which must also occur
for one of the replacements of F. The case where G is empty is similar.
Finally, Step 3 involves the generation of relations by generative integrity
constraints; hence equivalence is maintained.
For the rest of this paper we will assume that we are dealing with struc-
tured databases. We will also assume that the axioms (of IDB) are compiled.
This means that all the intensiona ...
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