Data warehouse is an essential component of almost every modern enterprise information system. It stores huge amount of subject-oriented, time-stamped, non-volatile and integrated data. It is highly required of the system to respond to complex online analytical queries posed against its data warehouse in seconds for efficient decision making. Optimization of online analytical query processing (OLAP) could substantially minimize delays in query response time. Materialized view is an efficient and effective OLAP query optimization technique to minimize query response time. Selecting a set of such appropriate views for materialization is referred to as view selection, which is a nontrivial task. In this regard, an Artificial Bee Colony (ABC) based view selection algorithm (ABCVSA), which has been adapted by incorporating N-point and GBFS based N-point random insertion operations, to select Top-K views from a multidimensional lattice is proposed. Experimental results show that ABCVSA performs better than the most fundamental view selection algorithm HRUA. Thus, the views selected using ABCVSA on materialization would reduce the query response time of OLAP queries and thereby aid analysts in arriving at strategic business decisions in an effective manner.
Decision support systems (DSS) constitute one of the most crucial components of almost every corporation's information system. Data warehouse provides the DSS with massive volumes of quality corporate data for analysis. On account of the volume of corporate data, its processing time of on-line analytical queries is huge (in hours and days). Materialized views have been used to substantially improve query performance. Nevertheless, selecting appropriate sets of materialized views is an NP-Complete problem. In this paper, a new discrete bumble bee mating inspired view selection algorithm (BBMVSA) that selects Top-K views from a multidimensional lattice has been proposed. Experimental results show that BBMVSA was able to select fairly good quality Top-K views incurring a lower TVEC. Materialization of the selected views would improve the overall data analysis of DSS and would facilitate the decision making process.
In the present information age, data and information are vital not just for the survival of any corporate entity, but also to provide it with an edge over its competitors. Data warehouses have become the foundational databases of almost every corporation. However, extracting new information from these data warehouses takes hours, and even days, which is practically unacceptable. Materialized views have been popularly used to facilitate fast information extraction. However, the selection of appropriate views, which significantly accelerate information synthesis is an NP-Complete problem. The aim of this paper is to select near optimal sets of views for materialization using the improvement bee colony optimization algorithm. The experimental results indicate that the improvement bee colony optimization algorithm performs better than the constructive bee colony optimization algorithm and the fundamental view selection algorithm HRUA. The views thus selected would significantly minimize the response time of analytical queries, when materialized, resulting in efficient strategic decision making.
Data warehouse was designed to cater to the strategic decision making needs of an organization. Most queries posed on them are on-line analytical queries, which are complex and computation intensive in nature and have high query response times when processed against a large data warehouse. This time can be substantially reduced by materializing pre-computed summarized views and storing them in a data warehouse. All possible views cannot be materialized due to storage space constraints. Also, an optimal selection of subsets of views is shown to be an NP-Complete problem. This problem of view selection has been addressed in this paper by selecting a beneficial set of views, from amongst all possible views, using the swarm intelligence technique Marriage in Honey Bees Optimization (MBO). An MBO based view selection algorithm (MBOVSA), which aims to select views that incur the minimum total cost of evaluating all the views (TVEC), is proposed. In MBOVSA, the search has been intensified by incorporating the royal jelly feeding phase into MBO. MBOVSA, when compared with the most fundamental greedy based view selection algorithm HRUA, is able to select comparatively better quality views.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.