Efficient Materialized View Selection for Multi-Dimensional Data Cube Models

Efficient Materialized View Selection for Multi-Dimensional Data Cube Models

Naveen Dahiya (Maharaja Surajmal Institute of Technology, New Delhi, India), Vishal Bhatnagar (Department of Computer Science and Engineering, Ambedkar Institute of Advanced Communication Technologies and Research, New Delhi, India) and Manjeet Singh (Y.M.C.A. University of Science and Technology, Faridabad, India)
Copyright: © 2016 |Pages: 23
DOI: 10.4018/IJIRR.2016070104


Decision Support Systems help managers to make intelligent decisions by throwing complex queries on large databases. The response time to queries is a very crucial factor in governing the quality of decision support systems. The response time can be greatly improved by using query optimization techniques. A powerful query optimization technique selects only some of the views and not all views for materialization. The authors in this paper present a refined greedy selection approach using forward references to give better materialized view selection. The approach works on lattice framework of data that is capable enough to show inter dependencies of data. The choice of materialized views using the proposed approach gives a better trade off in terms of space/benefits, which is proved from the experimental results. The refined greedy selection approach is independent of space constraint and depends on number of passes entered by the user. The view selection is further enhanced by including space constraints to the results of greedy and refined greedy approach using knapsack implementation.
Article Preview

1. Introduction

Decision Support Systems (Harinarayan et al 1996) are used by all business enterprises to gain competitive advantage in current market scenario. All the decision support systems are supported by huge data warehouses at the backend. Complex queries run on data warehouses and results achieved. Query response time is one of the major factors affecting the quality of data warehouses. A number of query optimization (Rafanelli 2003; Parimala and Kumar 2002) techniques exist of which one such technique involves greedy selection of views that defines the order of view selection. The greedy approach (Harinarayan et al 1996) selects the view that has maximum cost benefit among all the views not selected so far. The greedy approach aims at selecting a fixed number of views to be materialized irrespective of space constraint.

The authors aim to select materialized views following a refined greedy approach. At each pass one view is selected that gives maximum cost benefit. When more than one views with same maximum cost benefits exist, then the choice of views is made by selecting the view that gives maximum cost benefit in next subsequent pass. If multiple views with same maximum cost benefits exist in the subsequent pass, then that view is selected corresponding to which a view has maximum cost benefit and minimum occupied space in the subsequent pass. The proposed approach considers cost benefits along with space occupied in greedy selection of views, makes use of forward referencing and is capable enough to give better results than existing greedy approach. The results achieved using refined greedy approach is then used for view selection under space constraints using knapsack implementation.

1.1. Preliminaries

Few terms are used throughout the content of paper and should be known to understand the paper and its implications in research domain. The terms are as follows:

  • View: A derived relation/result in response to a query. It is defined in terms of base relation and/or combination of attributes (Mami and Bellahsene 2012). Each cell in multidimensional cubes forms a view.

  • Materialized View: A view is materialized if its result in response to query is stored in memory. It may be local copy of remotely located data items, or a result of joins/aggregations (Mami and Bellahsene 2012; Ye et al 2005). It is the set of materialized views whose optimal selection improves query optimization.

  • View Selection: It aims at selecting a set of materialized views given some database to optimize query response time (Mami and Bellahsene 2012). The optimal view selection improves query response time and is one of the main factors affecting query optimization of decision support systems.

  • Data Cubes: The data in a data warehouse is viewed along multiple dimensions. Multidimensional analysis of data is graphically represented as data cubes (Mami and Bellahsene 2012). The data cube is the source for view generation.

  • Lattice: A Lattice (Shukla et al 2000) is a graphical framework used to show dependencies among multiple views of a multi dimensional data warehouse. Lattice is input for materialized view selection approaches. A lattice is a ordered collection of views to which view selection approaches are applied to get optimal subset of materialized views. The optimal selection of views enhances query optimization. Lattice framework is explained in detail in the successive sections of the paper.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 10: 4 Issues (2020): Forthcoming, Available for Pre-Order
Volume 9: 4 Issues (2019): 3 Released, 1 Forthcoming
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing