Authors: Mohammad Haider, T.V. Vijay Kumar
Addresses: School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi-110067, India. ' School of Computer and Systems Sciences, Jawaharlal Nehru University, New Delhi-110067, India
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.
Keywords: data warehousing; materialised views selection; greedy algorithm; decision making; materialisation; query response time; query frequency.
International Journal of Value Chain Management, 2011 Vol.5 No.2, pp.95 - 105
Published online: 23 Aug 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article