Materialised views selection using size and query frequency
by Mohammad Haider, T.V. Vijay Kumar
International Journal of Value Chain Management (IJVCM), Vol. 5, No. 2, 2011

Abstract: The queries for decision making are usually analytical and complex in nature and their response times are high when processed against a large data warehouse. This problem of high response times can be addressed by materialising views over a data warehouse. Since all possible views cannot be materialised due to space constraint, there is a need to select an appropriate subset of views that can improve the query response time. One way to address this problem is by selecting views in a greedy manner. Most of the greedy-based view selection algorithms consider size of the views to select most beneficial views for materialisation. This paper presents a greedy based approach that considers query frequency, along with the size, of the views to select most profitable views for materialisation. These profitable views are likely to answer most future queries and thereby may lead to reduction in the query response time.

Online publication date: Thu, 26-Mar-2015

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 Value Chain Management (IJVCM):
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