Algorithms for selecting views and indexes to answer queries

In many contexts it is beneficial to answer database queries using derived data called views. Using views in query answering is relevant in applications in information integration, data warehousing, web-site design, and query optimization. The problem of answering queries using views can be divided into a number of subproblems. The first step in the process of view selection is to identify which view can be used to answer queries from the given set. The second step is to determine possible reformulations of the workload queries. The last step is choosing views that can be maintained appropriately and that minimize the processing time of the input query workload. In our work we address the problem of selecting and precomputing indexes and materialized views in a database system, with the goal of improving the processing performance for frequent and important queries. The focus of our work is to develop a unified quality-centered view- and index-selection approach, for a range of query, view, and index classes that are typical in practical database systems. To the best of our knowledge, we are the first to adopt the solution-quality focus for this generic practical problem setting.

[1]  Surajit Chaudhuri,et al.  An overview of data warehousing and OLAP technology , 1997, SGMD.

[2]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

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

[4]  Surajit Chaudhuri,et al.  An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server , 1997, VLDB.

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

[6]  D. Shasha,et al.  Hierarchically Split Cube Forests for Decision Support: description and tuned design , 1996 .

[7]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

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

[9]  Rada Chirkova,et al.  Query evaluation using overlapping views: completeness and efficiency , 2006, SIGMOD Conference.

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

[11]  Myoung-Ho Kim,et al.  Finding an efficient rewriting of OLAP queries using materialized views in data warehouses , 2002, Decis. Support Syst..

[12]  Rada Chirkova,et al.  Automated database restructuring , 2002 .

[13]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

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

[15]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

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

[17]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[18]  Rada Chirkova,et al.  View and index selection for query-performance improvement: Algorithms, heuristics and complexity , 2007 .

[19]  Patricia G. Selinger,et al.  Access path selection in a relational database management system , 1979, SIGMOD '79.

[20]  Guy M. Lohman,et al.  Measuring the Complexity of Join Enumeration in Query Optimization , 1990, VLDB.

[21]  Guy M. Lohman.  Is (Your) Database Research Having Impact? , 2007, DASFAA.

[22]  Inderpal Singh Mumick,et al.  Selection of views to materialize in a data warehouse , 1997, IEEE Transactions on Knowledge and Data Engineering.

[23]  Timos K. Sellis,et al.  Multiple-query optimization , 1988, TODS.

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

[25]  Matthias F. Stallmann,et al.  Effective bounding techniques for solving unate and binate covering problems , 2005, Proceedings. 42nd Design Automation Conference, 2005..

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

[27]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[28]  Surajit Chaudhuri,et al.  Automatic physical database tuning: a relaxation-based approach , 2005, SIGMOD '05.

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

[30]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[31]  Inderpal Singh Mumick,et al.  Selection of Views to Materialize Under a Maintenance Cost Constraint , 1999, ICDT.

[32]  Rada Chirkova,et al.  A Formal Model for the Problem of View Selection for Aggregate Queries , 2005, ADBIS.

[33]  Kyuseok Shim,et al.  Optimizing queries with materialized views , 1995, Proceedings of the Eleventh International Conference on Data Engineering.

[34]  Jennifer Widom,et al.  Database Systems: The Complete Book , 2001 .

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

[36]  Howard J. Karloff,et al.  On the complexity of the view-selection problem , 1999, PODS '99.

[37]  Surajit Chaudhuri,et al.  Automated Selection of Materialized Views and Indexes in SQL Databases , 2000, VLDB.

[38]  Rada Chirkova,et al.  Linearly Bounded Reformulations of Conjunctive Databases , 2000, Computational Logic.

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

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

[41]  Jeffrey D. Ullman,et al.  Index selection for OLAP , 1997, Proceedings 13th International Conference on Data Engineering.

[42]  Hamid Pirahesh,et al.  Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Totals , 1996, Data Mining and Knowledge Discovery.

[43]  J. Krarup,et al.  The simple plant location problem: Survey and synthesis , 1983 .

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

[45]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..