MVPP-Based Materialized View Selection in Data Warehouses Using Simulated Annealing

2020 ◽  
Vol 29 (03) ◽  
pp. 2050001
Author(s):  
Mohsen Mohseni ◽  
Mohammad Karim Sohrabi
Keyword(s):  
Simulated Annealing ◽  
Decision Support ◽  
Response Time ◽  
Decision Support Systems ◽  
Support Systems ◽  
Experimental Results ◽  
Total Cost ◽  
View Selection ◽  
Materialized View ◽  
Materialized View Selection

The process of extracting data from different heterogeneous data sources, transforming them into an integrated, unified and cleaned repository, and storing the result as a single entity leads to the construction of a data warehouse (DW), which facilitates access to data for the users of information systems and decision support systems. Due to their enormous volumes of data, processing of analytical queries of decision support systems need to scan very large amounts of data, which has a negative effect on the systems’ response time. Because of the special importance of online analytical processing (OLAP) in these systems, to enhance the performance and improve the query response time of the system, an appropriate number of views of the DW are selected for materialization and will be utilized for responding to the analytical queries, instead of direct access to the base relations. Memory constraint and views maintenance overhead are two main limitations that make it impossible, in most cases, to materialize all views of the DW. Selecting a proper set of views of DW for materialization, called materialized view selection (MVS) problem, is an important research issue that has been focused in various papers. In this paper, we have proposed a method, called P-SA, to select an appropriate set of views using an improved version of simulated annealing (SA) algorithm that utilizes a proper neighborhood selection strategy. P-SA uses the multiple view processing plan (MVPP) structure for selecting the views. Data and queries of a benchmark DW have been used in experimental results for evaluating the introduced method. The experimental results show better performance of the P-SA compared to other SA-based MVS methods for increasing the number of queries, in terms of the total cost of view maintenance and query processing. Moreover, the total cost of queries in the P-SA is also better than the other important SA-based MVS methods of the literature when the size of the DW is increased.

Efficient Materialized View Selection for Multi-Dimensional Data Cube Models

2016 ◽  
Vol 6 (3) ◽  
pp. 52-74 ◽  
Author(s):  
Naveen Dahiya ◽  
Vishal Bhatnagar ◽  
Manjeet Singh
Keyword(s):  
Decision Support ◽  
Response Time ◽  
Decision Support Systems ◽  
Query Optimization ◽  
Support Systems ◽  
Optimization Techniques ◽  
View Selection ◽  
Materialized View ◽  
Selection Approach ◽  
Materialized View Selection

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.

Materialized View Selection in the Data Warehouse

2010 ◽  
Vol 29-32 ◽  
pp. 1133-1138 ◽  
Author(s):  
Li Juan Zhou ◽  
Hai Jun Geng ◽  
Ming Sheng Xu
Keyword(s):  
Decision Support ◽  
Data Warehouse ◽  
Materialized Views ◽  
Storage Space ◽  
View Selection ◽  
Materialized View ◽  
Query Response Time ◽  
Materialized View Selection ◽  
Optimal Efficiency ◽  
The Cost

A data warehouse stores materialized views of data from one or more sources, with the purpose of efficiently implementing decision-support or OLAP queries. Materialized view selection is one of the crucial decisions in designing a data warehouse for optimal efficiency. The goal is to select an appropriate set of views that minimizes sum of the query response time and the cost of maintaining the selected views, given a limited amount of resource, e.g., materialization time, storage space, etc. In this article, we present an improved PGA algorithm to accomplish the view selection problem; the experiments show that our proposed algorithm shows it’s superior.

Statistical Sampling to Instantiate Materialized View Selection Problems in Data Warehouses

2008 ◽  
pp. 2201-2225
Author(s):  
Mesbah U. Ahmed ◽  
Vikas Agrawal ◽  
Udayan Nandkeolyar ◽  
P. S. Sundararaghavan
Keyword(s):  
Decision Support ◽  
Data Warehouse ◽  
Business Decision ◽  
Time Dynamic ◽  
View Selection ◽  
Materialized View ◽  
Novel Approach ◽  
Maintenance Time ◽  
Materialized View Selection ◽  
The Right

In any online decision support system, the backbone is a data warehouse. In order to facilitate rapid response to complex business decision support queries, it is a common practice to materialize an appropriate set of the views at the data warehouse. However, it typically requires the solution of the Materialized View Selection (MVS) problem to select the right set of views to materialize in order to achieve a certain level of service given a limited amount of resource such as materialization time, storage space, or view maintenance time. Dynamic changes in the source data and the end users requirement necessitate rapid and repetitive instantiation and solution of the MVS problem. In an online decision support context, time is of the essence in finding acceptable solutions to this problem. In this chapter, we have used a novel approach to instantiate and solve four versions of the MVS problem using three sampling techniques and two databases. We compared these solutions with the optimal solutions corresponding to the actual problems. In our experimentation, we found that the sampling approach resulted in substantial savings in time while producing good solutions.

Assigning Value to Clinical Information – A Major Limiting Factor in the Implementation of Decision-Support Systems

1996 ◽  
Vol 35 (01) ◽  
pp. 1-4 ◽  
Author(s):  
F. T. de Dombal
Keyword(s):  
Decision Support ◽  
Decision Support Systems ◽  
Support Systems ◽  
Clinical Information ◽  
Limiting Factor ◽  
Major Difficulty ◽  
Computer Aided ◽  
Computer Aided Decision

AbstractThis paper deals with a major difficulty and potential limiting factor in present-day decision support - that of assigning precise value to an item (or group of items) of clinical information. Historical determinist descriptive thinking has been challenged by current concepts of uncertainty and probability, but neither view is adequate. Four equations are proposed outlining factors which affect the value of clinical information, which explain some previously puzzling observations concerning decision support. It is suggested that without accommodation of these concepts, computer-aided decision support cannot progress further, but if they can be accommodated in future programs, the implications may be profound.

Architectures for Architects

1993 ◽  
Vol 32 (01) ◽  
pp. 12-13 ◽  
Author(s):  
M. A. Musen
Keyword(s):  
Decision Support ◽  
Decision Support Systems ◽  
Clinical Decision Support ◽  
Support Systems ◽  
Clinical Decision Support Systems ◽  
Clinical Decision ◽  
Design And Development

Abstract:Response to Heathfield HA, Wyatt J. Philosophies for the design and development of clinical decision-support systems. Meth Inform Med 1993; 32: 1-8.

Sign in / Sign up

Export Citation Format

Share Document