An Extensive Survey on Various Query Optimization Techniques

As the database management field has diversified to consider settings in which queries are increasingly complex, statistics are less available, or data is stored remotely, there has been an acknowledgment that the available optimization techniques are insufficient. This has led to a plethora of new techniques, generally placed under the common banner of optimizing complex queries that focus on rewriting the complex queries in a simple manner. Query optimization is the bottleneck of database application performance especially those which store history i.e. data warehouse. SQL is used as query language because most data warehouses are based on relational or extended relational database system. In this survey paper, we identify many of the common issues, themes, and approaches that pervade this work, and the settings in which each piece of work is most appropriate. Our goal with this paper is to be a ―value-add‖ over the existing papers on the material, providing not only a brief overview of each technique, but also a basic framework for understanding the field of query processing in general and also to reduce the complexity of the queries to enhance the query processing and optimization engines. Keywords— Data warehouse, query optimization, query processing, complex queries, SQL.

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

[2]  Davide Martinenghi,et al.  Cost-Aware Rank Join with Random and Sorted Access , 2012, IEEE Transactions on Knowledge and Data Engineering.

[3]  Kyuseok Shim,et al.  Query Optimization in the Presence of Foreign Functions , 1993, VLDB.

[4]  Paul Larson,et al.  Grouping and Duplicate Elimination: Benefits of Early Aggregation , 1997 .

[5]  R. Varshney,et al.  Supporting top-k join queries in relational databases , 2011 .

[6]  Kenneth A. Ross,et al.  Groupwise Processing of Relational Queries , 1997, VLDB.

[7]  Gultekin Özsoyoglu,et al.  Extending relational algebra and relational calculus with set-valued attributes and aggregate functions , 1987, TODS.

[8]  Giovanni Maria Sacco,et al.  Truly Adaptive Optimization: The Basic Ideas , 2006, DEXA.

[9]  Wolfgang Lehner,et al.  Query optimization by using derivability in a data warehouse environment , 2000, DOLAP '00.

[10]  Walid G. Aref,et al.  Scheduling for shared window joins over data streams , 2003, VLDB.

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

[12]  Alejandro P. Buchmann,et al.  Encoded bitmap indexing for data warehouses , 1998, Proceedings 14th International Conference on Data Engineering.

[13]  Hui Zhao,et al.  MapReduce model-based optimization of range queries , 2012, 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery.

[14]  Philip S. Yu,et al.  Effectiveness of Parallel Joins , 1990, IEEE Trans. Knowl. Data Eng..

[15]  Johannes Gehrke,et al.  Rule-based multi-query optimization , 2009, EDBT '09.

[16]  Nikos Mamoulis,et al.  Efficient processing of joins on set-valued attributes , 2003, SIGMOD '03.

[17]  Ralf Schenkel,et al.  Ranking under Tight Budgets , 2012, 2012 23rd International Workshop on Database and Expert Systems Applications.

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

[19]  Mohammed Odeh,et al.  A Survey of Distributed Query Optimization , 2005, Int. Arab J. Inf. Technol..

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

[21]  Quan Wang,et al.  Algorithms and applications for universal quantification in relational databases , 2003, Inf. Syst..

[23]  Philip S. Yu,et al.  Optimization of Parallel Execution for Multi-Join Queries , 1996, IEEE Trans. Knowl. Data Eng..

[24]  Werner Kießling,et al.  Optimization of Relational Preference Queries , 2005, ADC.

[25]  Teh Ying Wah,et al.  Query Processing Techniques in Data Warehousing Using Cost Model , 2000 .

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

[27]  David J. DeWitt,et al.  NiagaraCQ: a scalable continuous query system for Internet databases , 2000, SIGMOD '00.

[28]  Hamid Pirahesh,et al.  Extensible/rule based query rewrite optimization in Starburst , 1992, SIGMOD '92.

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

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