Query answering-based view selection

T.V. Vijay Kumar and Mohammad Haider

International Journal of Business Information Systems, 2015, vol. 18, issue 3, 338-353

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.

Keywords: data warehouses; materialised view selection; greedy algorithms; query answering; decision making queries. (search for similar items in EconPapers)
Date: 2015
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.inderscience.com/link.php?id=68168 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijbisy:v:18:y:2015:i:3:p:338-353

Access Statistics for this article

More articles in International Journal of Business Information Systems from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().