Efficient mid-query re-optimization of sub-optimal query execution plans
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Materialized view selection and maintenance using multi-query optimization
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Database Management Systems
Dynamic Query Optimization in Rdb/VMS
Proceedings of the Ninth International Conference on Data Engineering
fAST Refresh using Mass Query Optimization
Proceedings of the 17th International Conference on Data Engineering
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
The Fittest Survives: An Adaptive Approach to Query Optimization
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Recommending Materialized Views and Indexes with IBM DB2 Design Advisor
ICAC '04 Proceedings of the First International Conference on Autonomic Computing
Query evaluation using overlapping views: completeness and efficiency
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
The GEON portal: accelerating knowledge discovery in the geosciences
WIDM '06 Proceedings of the 8th annual ACM international workshop on Web information and data management
View-based query processing: On the relationship between rewriting, answering and losslessness
Theoretical Computer Science
The Computer Journal
An evolutionary approach to materialized views selection in a datawarehouse environment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A materialized-view based technique to optimize progressive queries via dependency analysis
Proceedings of the 2011 Conference of the Center for Advanced Studies on Collaborative Research
CASCON '12 Proceedings of the 2012 Conference of the Center for Advanced Studies on Collaborative Research
| Hi-index | 0.00 |
There is an increasing demand to process emerging types of queries, such as progressive queries (PQs), from numerous contemporary database applications including telematics, ecommerce, business intelligence, and decision support. Unlike a conventional query, a progressive query is formulated in several steps, i.e., consisting of a set of inter-related step-queries (SQ). A user formulates their SQs on the fly based on the results returned by the previous SQs. Processing such queries provides performance improvement opportunities for a database management system. In this paper, we study the efficient processing of a special type of PQ, called a monotonic linear progressive query (MLPQ). We present a technique to process such PQs based on dynamically materialized views. The key idea is to create a superior-relationship graph for step-queries from historical PQs, which can be used to estimate the benefit of materializing a current step-query. The materialized views are then used to improve the performance of future step-queries. Algorithms and strategies to create and maintain a superior-relationship graph, dynamically select materialized views (step-queries), and the search for a materialized view to process a given step-query are discussed. Experimental results demonstrate that our proposed technique is quite promising in efficiently processing this type of progressive query.