Principles of artificial intelligence
Principles of artificial intelligence
Rdb/VMS: developing the data warehouse
Rdb/VMS: developing the data warehouse
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
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
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
View indexing in relational databases
ACM Transactions on Database Systems (TODS)
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
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th 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 Systematic Approach to Selecting Maintenance Policies in a Data Warehouse Environment
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Linearly Bounded Reformulations of Unary Databases
SARA '02 Proceedings of the 4th International Symposium on Abstraction, Reformulation, and Approximation
What Difference Heuristics Make: Maintenance-Cost View-Selection Revisited
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Optimization Algorithms for Simultaneous Multidimensional Queries in OLAP Environments
DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery
Reengineering of Database Applications to EJB Based Architecture
CAiSE '02 Proceedings of the 14th International Conference on Advanced Information Systems Engineering
A User-centric View of Data Warehouse Maintenance Issues
BNCOD 17 Proceedings of the 17th British National Conferenc on Databases: Advances in Databases
Efficient Utilization of Materialized Views in a Data Warehouse
PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Detecting Redundancy in Data Warehouse Evolution
ER '99 Proceedings of the 18th International Conference on Conceptual Modeling
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
ER '01 Proceedings of the 20th International Conference on Conceptual Modeling: Conceptual Modeling
Linearly Bounded Reformulations of Conjunctive Databases
CL '00 Proceedings of the First International Conference on Computational Logic
Heuristic Algorithms for Designing a Data Warehouse with SPJ Views
DaWaK '99 Proceedings of the First International Conference on Data Warehousing and Knowledge Discovery
Simulated annealing for materialized view selection in data warehousing environment
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
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
Materialized View Selection in XML Databases
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
A metamorphosis algorithm for the optimization of a multi-node OLAP system
EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
XML reconstruction view selection in XML databases: complexity analysis and approximation scheme
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Materialized view management in peer to peer environment
Proceedings of the International Conference & Workshop on Emerging Trends in Technology
Modeling view selection as a constraint satisfaction problem
DEXA'11 Proceedings of the 22nd international conference on Database and expert systems applications - Volume Part II
Aggregation strategies for columnar in-memory databases in a mixed workload
Proceedings of the 4th workshop on Workshop for Ph.D. students in information & knowledge management
Repairing dimension hierarchies under inconsistent reclassification
ER'11 Proceedings of the 30th international conference on Advances in conceptual modeling: recent developments and new directions
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
State transfer graph: an efficient tool for webview maintenance
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
Designing views to efficiently answer real SQL queries
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Roles of agents in data-intensive web sites
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part III
Handling inconsistencies in data warehouses
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
A survey of view selection methods
ACM SIGMOD Record
Materialized view selection for XQuery workloads
SIGMOD '12 Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data
Optimizing index deployment order for evolving OLAP
Proceedings of the 15th International Conference on Extending Database Technology
Repairing inconsistent dimensions in data warehouses
Data & Knowledge Engineering
A dynamic view materialization scheme for sequences of query and update statements
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
MOWS: macro and micro online webview selection
Proceedings of the 3rd International Conference on Web Intelligence, Mining and Semantics
Extended dimensions for cleaning and querying inconsistent data warehouses
Proceedings of the sixteenth international workshop on Data warehousing and OLAP
Hi-index | 0.00 |
A data warehouse stores materialized views derived from one or more sources for 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/or the cost of maintaining the selected views, given a limited amount of resource such as materialization time, storage space, or total view maintenance time. In this article, we develop algorithms to select a set of views to materialize in a data warehouse in order to minimize the total query response time under the constraint of a given total view maintenance time. As the above maintenance-cost view-selection problem is extremely intractable, we tackle some special cases and design approximation algorithms. First, we design an approximation greedy algorithm for the maintenance-cost view-selection problem in OR view graphs, which arise in many practical applications, e.g., data cubes. We prove that the query benefit of the solution delivered by the proposed greedy heuristic is within 63% of that of the optimal solution. Second, we also design an A* heuristic, that delivers an optimal solution, for the general case of AND-OR view graphs. We implemented our algorithms and a performance study of the algorithms shows that the proposed greedy algorithm for OR view graphs almost always delivers an optimal solution.