Exact and inexact methods for solving the problem of view selection for aggregate queries
by Zohreh Asgharzadeh Talebi, Rada Chirkova, Yahya Fathi
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 4, No. 3/4, 2009

Abstract: We study the following warehouse view-selection problem: Given a data-warehouse schema, a set of parameterised aggregate queries and their frequency distribution, and a storage-limit constraint, find a set of aggregate views that, when materialised in the warehouse, would minimise the evaluation costs of the frequent queries, subject to a storage-limit constraint. Optimising the layout of stored data using view selection has a direct impact on the performance of data warehouses. We introduce an integer-programming model to obtain optimal solutions for the warehouse view-selection problem, and propose a heuristic to obtain competitive inexact solutions where our exact method is not applicable.

Online publication date: Tue, 03-Nov-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com