Binding Propagation Techniques for the Optimization of Bound 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 amount of data needed to answer the query and, consequently, 1) reduces the complexity of computing a single model and, more importantly, 2) greatly reduces the number of models to be considered. Although, in this paper, we consider the application of the magic-set method, other rewriting techniques defined for special classes of queries can also be applied. To show the relevance of our technique, we have implemented a prototype of an optimizer. Several experiments have confirmed the value of the technique.

[1]  Li-Yan Yuan,et al.  A sound and complete query evaluation algorithm for relational databases with disjunctive information , 1989, PODS '89.

[2]  Jürgen Dix,et al.  A general Approach to Bottom-Up Computation of Disjunctive Semantics , 1994, NMELP.

[3]  Jack Minker,et al.  Semantics of Disjunctive Deductive Databases , 1992, ICDT.

[4]  Carolina Ruiz,et al.  A Characterization of the Partial Stable Models For Disjunctive Databases , 1997, ILPS.

[5]  Jeffrey F. Naughton,et al.  Efficient evaluation of right-, left-, and multi-linear rules , 1989, SIGMOD '89.

[6]  Sergio Greco,et al.  The PushDown Method to Optimize Chain Logic Programs (Extended Abstract) , 1995, ICALP.

[7]  Kenneth A. Ross,et al.  Modular stratification and magic sets for Datalog programs with negation , 1994, JACM.

[8]  Kotagiri Ramamohanarao,et al.  Efficient Bottom-UP Computation of Queries on Stratified Databases , 1991, J. Log. Program..

[9]  François Bry,et al.  SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[10]  Jeffrey D. Ullman,et al.  Principles of Database and Knowledge-Base Systems, Volume II , 1988, Principles of computer science series.

[11]  Adnan H. Yahya.  Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Non-Monotonic Aspects , 1997, LPNMR.

[12]  Jack Minker,et al.  On Indefinite Databases and the Closed World Assumption , 1987, CADE.

[13]  Jürgen Dix,et al.  Partial Evaluation and Relevance for Approximations of Stable Semantics , 1994, ISMIS.

[14]  Donald W. Loveland,et al.  A Simple Near-Horn Prolog Interpreter , 1988, ICLP/SLP.

[15]  Sergio Greco,et al.  Binding Propagation in Disjunctive Databases , 1998, VLDB.

[16]  Gerald Pfeifer,et al.  A Deductive System for Non-Monotonic Reasoning , 1997, LPNMR.

[17]  David W. Reed,et al.  SATCHMORE: SATCHMO with RElevancy , 1995, Journal of Automated Reasoning.

[18]  Jack Minker,et al.  Bottom-Up Compuation of Perfect Models for Disjunctive Theories , 1995, J. Log. Program..

[19]  Sergio Greco,et al.  Querying Inconsistent Databases , 2000, LPAR.

[20]  Katsumi Inoue,et al.  Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving , 1997, CADE.

[21]  Jorge Lobo,et al.  Foundations of disjunctive logic programming , 1992, Logic Programming.

[22]  Jack Minker,et al.  A Fixpoint Semantics for Disjunctive Logic Programs , 1990, J. Log. Program..

[23]  Kenneth A. Ross,et al.  The Well Founded Semantics for Disjunctive Logic Programs , 1989, DOOD.

[24]  José Júlio Alferes,et al.  Classical Negation in Logic Programs , 1990 .

[25]  Jeffrey D. Ullman,et al.  Logical Query Optimization by Proff-Tree Transformation , 1993, J. Comput. Syst. Sci..

[26]  Catriel Beeri,et al.  On the power of magic , 1987, PODS '87.

[27]  Laks V. S. Lakshmanan,et al.  Probabilistic Deductive Databases , 1994, ILPS.

[28]  John Grant,et al.  Answering Queries in Indefinite Databases and the Null Value Problem , 1986, Adv. Comput. Res..

[29]  Donald W. Loveland,et al.  Near-Horn PROLOG , 1987, ICLP.

[30]  Gopalan Nadathur,et al.  Uniform proofs and disjunctive logic programming , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[31]  Georg Gottlob,et al.  Disjunctive datalog , 1997, TODS.

[32]  Teodor C. Przymusinski.  On the Declarative Semantics of Deductive Databases and Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[33]  Carolina Ruiz,et al.  A characterization of the partial stable models for disjunctive deductive databases , 1997, ICLP 1997.

[34]  Teodor C. Przymusinski.  Static semantics for normal and disjunctive logic programs , 1995, Annals of Mathematics and Artificial Intelligence.

[35]  Sergio Greco.  Minimal Founded Semantics for Disjunctive Logic Programming , 1999, LPNMR.

[36]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[37]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[38]  Rajshekhar Sunderraman,et al.  Indefinite and maybe information in relational databases , 1990, TODS.

[39]  Carolina Ruiz,et al.  Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs , 1994, NMELP.

[40]  David Maier,et al.  Magic sets and other strange ways to implement logic programs (extended abstract) , 1985, PODS '86.

[41]  Sergio Greco,et al.  Optimization of Disjunctive Queries , 1999, International Conference on Logic Programming.

[42]  Dietmar Seipel,et al.  A Data Structure for Efficient Deduction in Disjunctive Logic Programs , 1993, WLP.

[43]  David W. Reed,et al.  The Near-Horn Approach to Disjunctive Logic Programming , 1991, ELP.

[44]  Hidenori Itoh,et al.  Making Query Processing Goal-Directed in Disjunctive Logic Databases , 1995, ICLP.

[45]  Georg Gottlob,et al.  Default Logic as a Query Language , 1997, IEEE Trans. Knowl. Data Eng..

[46]  Lawrence J. Henschen,et al.  Deduction in non-Horn databases , 1985, Journal of Automated Reasoning.

[47]  Carlo Zaniolo,et al.  Database relations with null values , 1982, J. Comput. Syst. Sci..