Optimization of disjunctive queries

This paper presents a technique for the optimization of bound queries on disjunctive deductive databases. The optimization is based on the rewriting of the source program into an equivalent program which can be evaluated more efficiently. The proposed optimization reduces the size of the data relevant for the query and, consequently, greatly reduces the number of models to be considered to answer the query. Several experiments have confirmed the value of our technique.