Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Answering queries using views (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theory of answering queries using views
ACM SIGMOD Record
Generating efficient plans for queries using views
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
Selection of Views to Materialize in a Data Warehouse
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Materialized Views Selection in a Multidimensional Database
VLDB '97 Proceedings of the 23rd 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
A Formal Perspective on the View Selection Problem
Proceedings of the 27th International Conference on Very Large Data Bases
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
A formal perspective on the view selection problem
The VLDB Journal — The International Journal on Very Large Data Bases
Materializing views with minimal size to answer queries
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Selection of Views to Materialize in a Data Warehouse
IEEE Transactions on Knowledge and Data Engineering
Answering queries using materialized views with minimum size
The VLDB Journal — The International Journal on Very Large Data Bases
Efficient materialized view selection dynamic improvement algorithm
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Extended derivation cube based view materialization selection in distributed data warehouse
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Preview: optimizing view materialization cost in spatial data warehouses
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Hi-index | 0.00 |
The view-selection problem is to design and materialize a set of views over a database schema, such that the choice of views minimizes the cost of evaluating the selected workload of queries, and the combined size of the materialized views does not exceed a prespecified storage limit. Important applications of the view-selection problem include query optimization, data warehouse design, and information integration.We consider the view-selection problem in relational databases, for conjunctive queries and views. Suppose somebody wants to design a view-selection algorithm that outputs a polynomial number of views for all query workloads and storage limits and produces optimal selections of views independently of actual database contents. In previous work it was shown that it is impossible to design such an algorithm when the product (as for nested-loop joins) cost model is used. That is, there exist databases for which the number of views in an optima] viewset is exponential in the size of the database schema and query workload. As a consequence, under the product-cost model the view-selection problem has an exponential-time lower bound.Efficient join algorithms have a cost that is proportional to the sum of the sizes of the input and output relations. In this paper we prove that under the more practical sum-cost model, the view-selection problem also has an exponential time lower bound. As a consequence, under the sum-cost model it is also impossible to come up with a view-selection algorithm that outputs a polynomial number of views for all query workloads and databases, yet produces optimal selections of views.