Welcome to the InfoSci Platform
Reference Hub28
A Hybrid Approach for Data Warehouse View Selection

A Hybrid Approach for Data Warehouse View Selection

Biren Shah, Karthik Ramachandran, Vijay Raghavan
Copyright: © 2006 |Volume: 2 |Issue: 2 |Pages: 37
ISSN: 1548-3924|EISSN: 1548-3932|ISSN: 1548-3924|EISBN13: 9781615202126|EISSN: 1548-3924|DOI: 10.4018/jdwm.2006040101
Cite Article Cite Article

MLA

Shah, Biren, et al. "A Hybrid Approach for Data Warehouse View Selection." IJDWM vol.2, no.2 2006: pp.1-37. http://doi.org/10.4018/jdwm.2006040101

APA

Shah, B., Ramachandran, K., & Raghavan, V. (2006). A Hybrid Approach for Data Warehouse View Selection. International Journal of Data Warehousing and Mining (IJDWM), 2(2), 1-37. http://doi.org/10.4018/jdwm.2006040101

Chicago

Shah, Biren, Karthik Ramachandran, and Vijay Raghavan. "A Hybrid Approach for Data Warehouse View Selection," International Journal of Data Warehousing and Mining (IJDWM) 2, no.2: 1-37. http://doi.org/10.4018/jdwm.2006040101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Materialized view selection is one of the crucial decisions in designing a data warehouse for optimal efficiency. Static selection of views may materialize certain views that are not beneficial as the data and usage trends change over time. On the contrary, dynamic selection of views works better only for queries demanding a high degree of aggregation. These facts point to the need for a technique that combines the improved response time of the static approach and the automated tuning capability of the dynamic approach. In this article, we propose a hybrid approach for the selection of materialized views. The idea is to partition the collection of all views into a static and dynamic set such that views selected for materialization from the static set are persistent over multiple query (and maintenance) windows, whereas views selected from the dynamic set can be queried and/or replaced on the fly. Highly aggregated views are selected on the fly based on the query access patterns of users, whereas the more detailed static set of views plays a significant role in the efficient maintenance of the dynamic set of views and in answering certain detailed view queries. We prove that our proposed strategy satisfies the monotonicity requirements, which is essential in order for the greedy heuristic to deliver competitive solutions. Experimental results show that our approach outperforms Dynamat, a well-known dynamic view management system that is known to outperform optimal static view selection.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.