Principles of artificial intelligence
Principles of artificial intelligence
ACM Transactions on Database Systems (TODS)
Multiple query optimization with Depth-First Branch-and-Bound and dynamic query ordering
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Multi-table joins through bitmapped join indices
ACM SIGMOD Record
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A threshold of ln n for approximating set cover (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Microsoft index turning wizard for SQL Server 7.0
SIGMOD '98 Proceedings of the 1998 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
The view-selection problem has an exponential-time lower bound for conjunctive queries and views
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
View selection using randomized search
Data & Knowledge 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
Materialized View Selection for Multidimensional Datasets
VLDB '98 Proceedings of the 24rd 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
Including Group-By in Query Optimization
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Eager Aggregation and Lazy Aggregation
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server
VLDB '97 Proceedings of the 23rd 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
Redbrick Vista: Aggregate Computation and Management
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Selection and maintenance of views in a data warehouse
Selection and maintenance of views in a data warehouse
Algorithms for Materialized View Design in Data Warehousing Environment
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Multiobjective genetic algorithms for materialized view selection in OLAP data warehouses
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Exact and inexact methods for selecting views and indexes for OLAP performance improvement
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
An approach for incorporating quality-based cost---benefit analysis in data warehouse design
Information Systems Frontiers
Information Sciences: an International Journal
Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Data mining-based materialized view and index selection in data warehouses
Journal of Intelligent Information Systems
Exact and inexact methods for solving the problem of view selection for aggregate queries
International Journal of Business Intelligence and Data Mining
Journal of Intelligent Information Systems
Extended cascaded star schema and ECOLAP operations for spatial data warehouse
IDEAL'09 Proceedings of the 10th international conference on Intelligent data engineering and automated learning
Mining information for constructing materialised views
International Journal of Information and Communication Technology
A sample advisor for approximate query processing
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Efficient processing of monotonic linear progressive queries via dynamic materialized views
Proceedings of the 2010 Conference of the Center for Advanced Studies on Collaborative Research
A query answering greedy algorithm for selecting materialized views
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Materialized view management in peer to peer environment
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
We challenge you to certify your updates
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Revisiting the partial data cube materialization
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
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
Optimization of distributed queries in grid via caching
OTM'05 Proceedings of the 2005 OTM Confederated international conference on On the Move to Meaningful Internet Systems
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
Dynamic view selection for OLAP
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Preview: optimizing view materialization cost in spatial data warehouses
DaWaK'06 Proceedings of the 8th international conference on Data Warehousing and Knowledge Discovery
Conceptual schema-centric development: a grand challenge for information systems research
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
Selective view materialization in a spatial data warehouse
DaWaK'05 Proceedings of the 7th international conference on Data Warehousing and Knowledge Discovery
Exploitation of referential integrity constraints for efficient update of data warehouse views
BNCOD'05 Proceedings of the 22nd British National conference on Databases: enterprise, Skills and Innovation
Efficient update of data warehouse views with generalised referential integrity differential files
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
Lossless reduction of datacubes
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Cascaded star: a hyper-dimensional model for a data warehouse
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Clustering-based materialized view selection in data warehouses
ADBIS'06 Proceedings of the 10th East European conference on Advances in Databases and Information Systems
Materialized views selection for answering queries
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
Dynamic materialized view selection algorithm: a clustering approach
ICDEM'10 Proceedings of the Second international conference on Data Engineering and Management
DBToaster: higher-order delta processing for dynamic, frequently fresh views
Proceedings of the VLDB Endowment
Materialised view construction in data warehouse for decision making
International Journal of Business Information Systems
CASCON '12 Proceedings of the 2012 Conference of the Center for Advanced Studies on Collaborative Research
Deterministic view selection for data-analysis queries: properties and algorithms
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Dynamic View Management System for Query Prediction to View Materialization
International Journal of Data Warehousing and Mining
Generalized scale independence through incremental precomputation
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
MOWS: macro and micro online webview selection
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
International Journal of Intelligent Information and Database Systems
Optimizing Sample Design for Approximate Query Processing
International Journal of Knowledge-Based Organizations
Hi-index | 0.00 |
A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. One of the most important decisions in designing a data warehouse is the selection of materialized views to be maintained at the warehouse. The goal is to select an appropriate set of views that minimizes total query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space, etc. In this article, we have developed a theoretical framework for the general problem of selection of views in a data warehouse. We present polynomial-time heuristics for a selection of views to optimize total query response time under a disk-space constraint, for some important special cases of the general data warehouse scenario, viz.: 1) an AND view graph, where each query/view has a unique evaluation, e.g., when a multiple-query optimizer can be used to general a global evaluation plan for the queries, and 2) an OR view graph, in which any view can be computed from any one of its related views, e.g., data cubes. We present proofs showing that the algorithms are guaranteed to provide a solution that is fairly close to (within a constant factor ratio of) the optimal solution. We extend our heuristic to the general AND-OR view graphs. Finally, we address in detail the view-selection problem under the maintenance cost constraint and present provably competitive heuristics.