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
424 Henschen and Park
Complex
Query
Evaluation
by
Decomposition
In this section, we introduce the query decomposition and evaluation theorems
to evaluate disjunctive and conjunctive queries by decomposing them into
their unit subqueries and utilizing the compiled information of such sub-
queries.
Query
Decomposition
Theorem
THEOREM 14 (QUERY DECOMPOSITION THEOREM)
Let CL1 and CL2 be ground clauses. "*" denotes
4
'don't care" and "t,"
"f," and "i" denote "true," "false," and "indefinite," respectively.
1.
Disjunctive decomposition 2. Conjunctive decomposition
CL1
CL2
CL1
ν
CL2
CL1 CL2
CL1
&
CL2
t * t f * f
f * CL2 t * CL2
i i i or t i i i or f ...
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