Deductive Databases

11/17/97


Click here to start


Table of Contents

Deductive Databases

Example Rules

The Meaning of Rules Proof-theoretic interpretation

The Meaning of Rules Proof-theoretic interpretation

The Meaning of Rules Model-theoretic interpretation

The Meaning of Rules Computational interpretation

The Datalog Data Model

Evaluation of Rules

Evaluation of Rules (without recursion)

Example (1)

Example (2)

Evaluation of Recursive Rules

Fixed Point

Fixed point (example)

Example

Example (continued)

Naïve evaluation method

Semi-Naïve evaluation

Reachability of Fixed Point

Closed World Assumption (CWA)

Problems with CWA

Author: Marek