Query Processing and Optimization

The ultimate purpose of a data warehouse is to support queries by end users who want to analyze the available information for an organization. However, from a more abstract point of view, queries are not only processed at the data warehouse back end.

[1]  Yehoshua Sagiv,et al.  Semantic query optimization in Datalog programs (extended abstract) , 1995, ILPS Workshop: Constraints and Databases.

[2]  Alon Y. Halevy,et al.  Equivalence, query-reachability and satisfiability in Datalog extensions , 1993, PODS '93.

[3]  Timos K. Sellis,et al.  Intelligent caching and indexing techniques for relational database systems , 1988, Inf. Syst..

[4]  Diego Calvanese,et al.  A Framework for Ontology Integration , 2001, The Emerging Semantic Web.

[5]  Cong Yu,et al.  TIMBER: A native XML database , 2002, The VLDB Journal.

[6]  Christian Böhm,et al.  Determining the Convex Hull in Large Multidimensional Databases , 2001, DaWaK.

[7]  Jeffrey F. Naughton,et al.  Sampling-Based Estimation of the Number of Distinct Values of an Attribute , 1995, VLDB.

[8]  Jeffrey F. Naughton,et al.  Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies , 1996, VLDB.

[9]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

[10]  Laks V. S. Lakshmanan,et al.  Optimizing the Secure Evaluation of Twig Queries , 2002, VLDB.

[11]  Patrick E. O'Neil,et al.  Improved query performance with variant indexes , 1997, SIGMOD '97.

[12]  Kyuseok Shim,et al.  Including Group-By in Query Optimization , 1994, VLDB.

[13]  S. Muthukrishnan,et al.  Influence sets based on reverse nearest neighbor queries , 2000, SIGMOD '00.

[14]  Inderpal Singh Mumick,et al.  The Stanford Data Warehousing Project , 1995 .

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

[16]  Nick Roussopoulos,et al.  An alternative storage organization for ROLAP aggregate views based on cubetrees , 1998, SIGMOD '98.

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

[18]  David J. DeWitt,et al.  Relational Databases for Querying XML Documents: Limitations and Opportunities , 1999, VLDB.

[19]  Juliana Freire,et al.  From XML schema to relations: a cost-based approach to XML storage , 2002, Proceedings 18th International Conference on Data Engineering.

[20]  Roy Goldman,et al.  WSQ/DSQ: a practical approach for combined querying of databases and the Web , 2000, SIGMOD 2000.

[21]  Kenneth A. Ross,et al.  Querying Multiple Features of Groups in Relational Databases , 1996, VLDB.

[22]  Jeffrey F. Naughton,et al.  On the Computation of Multidimensional Aggregates , 1996, VLDB.

[23]  H. V. Jagadish,et al.  ProTDB: Probabilistic Data in XML , 2002, VLDB.

[24]  Nick Roussopoulos,et al.  Cubetree: Organization of and Bulk Updates on the Data Cube , 1997, SIGMOD Conference.

[25]  Frank Wm. Tompa,et al.  Efficiently updating materialized views , 1986, SIGMOD '86.

[26]  Goetz Graefe,et al.  Multi-table joins through bitmapped join indices , 1995, SGMD.

[27]  Alfred V. Aho,et al.  Efficient optimization of a class of relational expressions , 1979, ACM Trans. Database Syst..

[28]  Surajit Chaudhuri,et al.  Data Warehousing and OLAP for Decision Support , 1997, DOOD.

[29]  Wenfei Fan,et al.  What's Hard about XML Schema Constraints? , 2002, DEXA.

[30]  Umeshwar Dayal,et al.  Of Nests and Trees: A Unified Approach to Processing Queries That Contain Nested Subqueries, Aggregates, and Quantifiers , 1987, VLDB.

[31]  Hans-Peter Kriegel,et al.  Parallel processing of spatial joins using R-trees , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[32]  David S. Johnson,et al.  Optimizing Conjunctive Queries that Contain Untyped Variables , 1983, SIAM J. Comput..

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

[34]  Laks V. S. Lakshmanan,et al.  Minimization of tree pattern queries , 2001, SIGMOD '01.