Authors: Rajib Goswami; Dhruba Kr Bhattacharyya; Malayananda Dutta; Jugal K. Kalita
Addresses: Department of Computer Science and Engineering, Tezpur University, Tezpur, India ' Department of Computer Science and Engineering, Tezpur University, Tezpur, India ' Department of Computer Science and Engineering, Tezpur University, Tezpur, India ' Department of Computer Science, University of Colorado, Colorado Springs, Colorado Springs, CO, USA
Abstract: To facilitate efficient query processing in data warehouses and develop online analytical processing (OLAP) for decision support systems, intermediate data derived in the middle of complex processing may be stored as a set of materialised views. It is not possible to save each and every intermediate query result due to limitation of space and updating cost. Therefore, an optimum set of views need to be selected for materialisation and, this requires a good optimisation technique. Many approaches have been presented in the literature to achieve good solutions to this problem. In this paper, we attempt to provide a comprehensive survey of the approaches and algorithms introduced to address the issue. We also attempt to identify the key issues and research challenges in this area.
Keywords: data warehousing; view selection; materialised views; query response cost; materialised view maintenance; online analytical processing; OLAP; HRU algorithm; randomised algorithm; AND-OR view graph; optimal query plan; query processing; decision support systems; DSS.
International Journal of Business Information Systems, 2016 Vol.21 No.1, pp.17 - 47
Received: 29 Mar 2014
Accepted: 17 Aug 2014
Published online: 01 Dec 2015 *