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
446 Bancilhon and Ramakrishnan
We
now
have
to
provide
a way to
generate d<|> from
φ. The
problem
is not
solved
in its
entirety
and
only
a
number
of
transformations
are
known.
In
Ban-
cilhon [1985], some transformations
are
given
in
terms
of the
relational
al-
gebra.
It should
be
noted, however, that
for the
method
to
work,
the
only property
we have
to
guarantee
is
that:
φ(ρ1
+
dpi,...)
-
φ(
Ρ
1,...) Cd<Kpl,dpl,...)
ςφ(ρ1 +
dpi,...)
Clearly,
the
closer
αφ(ρ1,αρ1,...) is to
(φ(ρ1
+
dpi,...) φ(ρ1,...)),
the
bet-
ter
the
optimization.
In the
worst case, where
we use φ for,
Semi-Naive
Evaluation behaves
as
Naive Evaluation. Here
are
some simple
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