Rewriting queries with arbitrary aggregation functions using views

The problem of rewriting aggregate queries using views is studied for conjunctive queries with arbitrary aggregation functions and built-in predicates. Two types of queries over views are introduced for rewriting aggregate queries: pure candidates and aggregate candidates. Pure candidates can be used to rewrite arbitrary aggregate queries. Aggregate candidates can be used to rewrite queries containing aggregate functions definable in terms of a commutative-semigroup operation. For both types of candidates (as well as for several relaxations of these candidates), the unfolding property holds. This allows characterizations for query equivalence to be used to determine whether a candidate is a rewriting of a query. The complexity of the rewriting-existence problem is also studied and upper and lower complexity bounds are given.

[1]  Jeffrey D. Ullman,et al.  Implementing data cubes efficiently , 1996, SIGMOD '96.

[2]  Rada Chirkova,et al.  Selecting and Using Views to Compute Aggregate Queries (Extended Abstract) , 2005, ICDT.

[3]  Marvin H. Solomon,et al.  The GMAP: a versatile tool for physical data independence , 1996, The VLDB Journal.

[4]  Maurizio Rafanelli,et al.  On the equivalence and rewriting of aggregate queries , 2004, Acta Informatica.

[5]  Hamid Pirahesh,et al.  Answering complex SQL queries using automatic summary tables , 2000, SIGMOD '00.

[6]  Werner Nutt,et al.  Rewriting aggregate queries using views , 1999, PODS.

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

[8]  Jeffrey D. Uuman Principles of database and knowledge- base systems , 1989 .

[9]  Sara Cohen Containment of aggregate queries , 2005, SGMD.

[10]  Werner Nutt,et al.  Deciding equivalences among aggregate queries , 1998, PODS '98.

[11]  Gerhard Weikum,et al.  ACM Transactions on Database Systems , 2005 .

[12]  Hamid Pirahesh,et al.  Answering complex SQL queries using automatic summary tables , 2000, SIGMOD 2000.

[13]  Maurizio Rafanelli,et al.  Querying aggregate data , 1999, PODS '99.

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

[15]  César A. Galindo-Legaria,et al.  Orthogonal optimization of subqueries and aggregation , 2001, SIGMOD '01.

[16]  Sara Cohen Equivalence, Containment and Rewriting of Aggregate Queries , 2004 .

[17]  Jonathan Goldstein,et al.  Optimizing queries using materialized views: a practical, scalable solution , 2001, SIGMOD '01.

[18]  Stéphane Grumbach,et al.  On the content of materialized aggregate views , 2003, J. Comput. Syst. Sci..

[19]  Divesh Srivastava,et al.  Data model and query evaluation in global information systems , 1995, Journal of Intelligent Information Systems.

[20]  Divesh Srivastava,et al.  Answering Queries with Aggregation Using Views , 1996, VLDB.

[21]  Jeffrey D. Ullman,et al.  Proof-tree transformation theorems and their applications , 1989, PODS.

[22]  Werner Nutt,et al.  Algorithms for Rewriting Aggregate Queries Using Views , 2000, DMDW.

[23]  Ashish Gupta,et al.  Materialized views: techniques, implementations, and applications , 1999 .

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

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

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

[27]  Per-Åke Larson,et al.  Computing Queries from Derived Relations , 1985, VLDB.

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

[29]  Stéphane Grumbach,et al.  On the content of materialized aggregate views , 2000, PODS '00.

[30]  Kyuseok Shim,et al.  Optimizing Queries with Aggregate Views , 1996, EDBT.

[31]  Ashish Gupta,et al.  Aggregate-Query Processing in Data Warehousing Environments , 1995, VLDB.

[32]  Per-Åke Larson,et al.  Eager Aggregation and Lazy Aggregation , 1995, VLDB.

[33]  Werner Nutt,et al.  Equivalences among aggregate queries with negation , 2005, TOCL.

[34]  Timos K. Sellis,et al.  Answering multidimensional queries on cubes using other cubes , 2000, Proceedings. 12th International Conference on Scientific and Statistica Database Management.

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

[36]  SagivYehoshua,et al.  Rewriting queries with arbitrary aggregation functions using views , 2006 .

[37]  Surajit Chaudhuri,et al.  Optimization of real conjunctive queries , 1993, PODS '93.

[38]  Per-Åke Larson,et al.  Query Transformation for PSJ-Queries , 1987, VLDB.

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

[40]  Patrick Valduriez,et al.  Using Heterogeneous Equivalences for Query Rewriting in Multidatabase Systems , 1995, CoopIS.