Language features for interoperability of databases with schematic discrepancies
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Optimization of real conjunctive queries
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Tables as a paradigm for querying and restructuring (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Deciding equivalences among aggregate queries
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Rewriting aggregate queries using views
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Answering complex SQL queries using automatic summary tables
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Optimizing queries using materialized views: a practical, scalable solution
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
SchemaSQL: An extension to SQL for multidatabase interoperability
ACM Transactions on Database Systems (TODS)
Optimizing Queries with Materialized Views
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
On Efficiently Implementing SchemaSQL on an SQL Database System
VLDB '99 Proceedings of the 25th International Conference on Very Large Data Bases
Automated Selection of Materialized Views and Indexes in SQL Databases
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Storage and Querying of E-Commerce Data
Proceedings of the 27th International Conference on Very Large Data Bases
Aggregate-Query Processing in Data Warehousing Environments
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
SchemaSQL - A Language for Interoperability in Relational Multi-Database Systems
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Answering Queries with Aggregation Using Views
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Optimization of SchemaSQL Queries
IDEAS '01 Proceedings of the International Database Engineering & Applications Symposium
Incremental Maintenance of Schema-Restructuring Views
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Answering queries using views: A survey
The VLDB Journal — The International Journal on Very Large Data Bases
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Incremental Maintenance of Schema-Restructuring Views in SchemaSQL
IEEE Transactions on Knowledge and Data Engineering
Stacked indexed views in microsoft SQL server
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
PIVOT and UNPIVOT: optimization and execution strategies in an RDBMS
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Selecting and using views to compute aggregate queries
ICDT'05 Proceedings of the 10th international conference on Database Theory
Hi-index | 0.00 |
We study optimization of relational queries using materialized views, where views may be regular or restructured. In a restructured view, some data from the base table(s) are represented as metadata-that is, schema information, such as table and attribute names-or vice versa. Using restructured views in query optimization opens up a new spectrum of views that were not previously available, and can result in significant additional savings in query-evaluation costs. These savings can be obtained due to a significantly larger set of views to choose from, and may involve reduced table sizes, elimination of self-joins, clustering produced by restructuring, and horizontal partitioning. In this paper we propose a general query-optimization framework that treats regular and restructured views in a uniform manner and is applicable to SQL select-project-join queries and views without or with aggregation. Within the framework we provide (1) algorithms to determine when a view (regular or restructured) is usable in answering a query and (2) algorithms to rewrite queries using usable views. Semantic information, such as knowledge of the key of a view, can be used to further optimize a rewritten query. Within our general query-optimization framework, we develop techniques for determining the key of a (regular or restructured) view, and show how this information can be used to further optimize a rewritten query. It is straightforward to integrate all our algorithms and techniques into standard query-optimization algorithms. Our extensive experimental results illustrate how using restructured views (in addition to regular views) in query optimization can result in a significant reduction in query-processing costs compared to a system that uses only regular views.