Query answering-based view selection Online publication date: Sat, 28-Mar-2015
by T.V. Vijay Kumar; Mohammad Haider
International Journal of Business Information Systems (IJBIS), Vol. 18, No. 3, 2015
Abstract: A data warehouse is designed for answering decision making queries. These queries are usually long, complex and exploratory in nature and involve aggregates over a large number of dimensions. As a result, the processing time for such queries, against a continuously growing data warehouse, is high. This problem can be addressed by materialising views over a data warehouse. This paper presents a query answering view selection algorithm (QAVSA) that considers the size and query answering capability of views to select the top-K views for materialisation from a multi-dimensional lattice. The views selected using QAVSA are likely to be beneficial both with respect to their size and their ability to answer decision making queries. Further, experimental results show that QAVSA, in comparison to the well known greedy algorithm HRUA, is able to efficiently select views that can provide answers to greater number of queries. This in turn would facilitate decision making.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Information Systems (IJBIS):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook