On the rewriting and efficient computation of bound disjunctive datalog queries

Authors:
Sergio Greco;Ester Zumpano
Affiliations:
University of Calabria, Rende - Italy;University of Calabria, Rende - Italy
Venue:
Proceedings of the 5th ACM SIGPLAN international conference on Principles and practice of declaritive programming
Year:
2003

Citing 20
Cited 0

Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
A fixpoint semantics for disjunctive logic programs

Journal of Logic Programming
On the power of magic

Journal of Logic Programming
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
Logical query optimization by proof-tree transformation

PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation

Information and Computation
The expressive powers of stable models for bound and unbound DATALOG queries

Journal of Computer and System Sciences - special issue on complexity theory
Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Non-determinism and weak constraints in datalog

New Generation Computing
Minimal model generation for refined answering of generalized queries in disjunctive deductive databases

Data & Knowledge Engineering
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Duality for Goal-Driven Query Processing in Disjunctive Deductive Databases

Journal of Automated Reasoning
Enhancing Disjunctive Datalog by Constraints

IEEE Transactions on Knowledge and Data Engineering
Binding Propagation Techniques for the Optimization of Bound Disjunctive Queries

IEEE Transactions on Knowledge and Data Engineering
Semantics of Disjunctive Deductive Databases

ICDT '92 Proceedings of the 4th International Conference on Database Theory
The PushDown Method to Optimize Chain Logic Programs (Extended Abstract)

ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
A Deductive System for Non-Monotonic Reasoning

LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A general Approach to Bottom-Up Computation of Disjunctive Semantics

ICLP '94/NMELP '94 Selected papers from the Workshop on Non-Monotonic Extensions of Logic Programming
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a technique for the optimization of bound queries over disjunctive deductive databases with constraints. The proposed approach consists of two distinct phases: i) the rewriting of queries for propagating bindings from the query goal into the program, and ii) the use of specialized algorithms computing rewritten queries. The rewriting of queries is based on the exploitation of a binding propagation technique which reduces the size of the data relevant to answer the query and, consequently, minimizes both the complexity of computing a single model and the whole number of models to be considered. As for general queries the rewriting technique does not ensure soundness, we present two sound and complete algorithms computing rewritten queries under brave and cautious reasoning. The efficiency of our algorithms has been proved by several experiments considering both classical search and optimization problems.