Deterministic view selection for data-analysis queries: properties and algorithms

Authors:
Rong Huang;Rada Chirkova;Yahya Fathi
Affiliations:
Operations Research Program, NC State University, Raleigh, NC;Computer Science Department, NC State University, Raleigh, NC;Operations Research Program, NC State University, Raleigh, NC
Venue:
ADBIS'12 Proceedings of the 16th East European conference on Advances in Databases and Information Systems
Year:
2012

Citing 19
Cited 1

Implementing data cubes efficiently

SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
An overview of data warehousing and OLAP technology

ACM SIGMOD Record
On the complexity of the view-selection problem

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient materialization and use of views in data warehouses

ACM SIGMOD Record
A general framework for the view selection problem for data warehouse design and evolution

Proceedings of the 3rd ACM international workshop on Data warehousing and OLAP
A case for dynamic view management

ACM Transactions on Database Systems (TODS)
View selection using randomized search

Data & Knowledge Engineering
Index Selection for OLAP

ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
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
Algorithms for Materialized View Design in Data Warehousing Environment

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Answering queries using views: A survey

The VLDB Journal — The International Journal on Very Large Data Bases
Constructing search spaces for materialized view selection

Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Selection of Views to Materialize in a Data Warehouse

IEEE Transactions on Knowledge and Data Engineering
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 Integer Linear Programming Approach to Database Design

ICDEW '07 Proceedings of the 2007 IEEE 23rd International Conference on Data Engineering Workshop
Exact and inexact methods for solving the problem of view selection for aggregate queries

International Journal of Business Intelligence and Data Mining
An overview of business intelligence technology

Communications of the ACM
Exact and inexact methods for solving the view and index selection problem for olap performance improvement

Exact and inexact methods for solving the view and index selection problem for olap performance improvement

An integer programming approach for the view and index selection problem

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The view-selection problem is a combinatorial optimization problem that arises in the context of on-line analytical processing (OLAP) in database management systems. We pose the problem as an integer programming (IP) model, study its structural properties, and propose effective techniques for reducing the search space of views and thus the size of the corresponding IP model. We then use these results to design both exact methods and heuristic algorithms that are effective for solving relatively large realistic-size instances of the problem.