Finding Equivalent Rewritings in the Presence of Arithmetic Comparisons

The problem of rewriting queries using views has received significant attention because of its applications in a wide variety of data-management problems. For select-project-join SQL (a.k.a. conjunctive) queries and views, there are efficient algorithms in the literature, which find equivalent and maximally contained rewritings. In the presence of arithmetic comparisons (ACs) the problem becomes more complex. We do not know how to find maximally contained rewritings in the general case. There are algorithms which find maximally contained rewritings only for special cases such as when ACs are restricted to be semi-interval. However, we know that the problem of finding an equivalent rewriting (if there exists one) in the presence of ACs is decidable, yet still doubly exponential. This complexity calls for an efficient algorithm which will perform better on average than the complete enumeration algorithm. In this work we present such an algorithm which is sound and complete. Its efficiency lies in that it considers fewer candidate rewritings because it includes a preliminary test to decide for each view whether it is potentially useful in some rewriting.

[1]  Larry J. Stockmeyer,et al.  The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..

[2]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[3]  Mihalis Yannakakis,et al.  Equivalences Among Relational Expressions with the Union and Difference Operators , 1980, J. ACM.

[4]  Anthony C. Klug.  On conjunctive queries containing inequalities , 1988, JACM.

[5]  Alon Y. Halevy,et al.  Queries Independent of Updates , 1993, VLDB.

[6]  Z. Meral Özsoyoglu,et al.  On Efficient Reasoning with Implication Constraints , 1993, DOOD.

[7]  Jennifer Widom,et al.  Constraint checking with partial information , 1994, PODS.

[8]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[9]  Divesh Srivastava,et al.  Answering Queries Using Views. , 1999, PODS 1995.

[10]  Joann J. Ordille,et al.  Querying Heterogeneous Information Sources Using Source Descriptions , 1996, VLDB.

[11]  Xiaolei Qian,et al.  Query folding , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[12]  Jeffrey D. Ullman,et al.  Answering queries using limited external query processors (extended abstract) , 1996, PODS.

[13]  Anand Rajaraman,et al.  Answering Queries Using Limited External Processors. , 1996, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems.

[14]  Ron van der Meyden.  The Complexity of Querying Indefinite Data about Linearly Ordered Domains , 1997, J. Comput. Syst. Sci..

[15]  Michael R. Genesereth,et al.  Answering recursive queries using views , 1997, PODS '97.

[16]  Phokion G. Kolaitis,et al.  On the complexity of the containment problem for conjunctive queries with built-in predicates , 1998, PODS '98.

[17]  Alberto O. Mendelzon,et al.  Tableau Techniques for Querying Information Sources through Global Schemas , 1999, ICDT.

[18]  Manolis Gergatsoulis,et al.  Answering Queries Using Materialized Views with Disjunctions , 1999, ICDT.

[19]  Val Tannen,et al.  Object/relational query optimization with chase and backchase , 2000 .

[20]  Prasenjit Mitra.  An algorithm for answering queries efficiently using views , 2001, ADC.

[21]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[22]  Chen Li,et al.  Generating efficient plans for queries using views , 2001, SIGMOD '01.

[23]  Alon Y. Halevy,et al.  MiniCon: A scalable algorithm for answering queries using views , 2000, The VLDB Journal.

[24]  Alin Deutsch,et al.  Xml query reformulation over mixed and redundant storage , 2002 .

[25]  Chen Li,et al.  Answering queries using views with arithmetic comparisons , 2002, PODS '02.

[26]  Chen Li,et al.  On Containment of Conjunctive Queries with Arithmetic Comparisons , 2004, EDBT.

[27]  Chen Li,et al.  Rewriting queries using views in the presence of arithmetic comparisons , 2006, Theor. Comput. Sci..