Approaches and issues in view selection for materialising in data warehouse

2016 ◽  
Vol 21 (1) ◽  
pp. 17 ◽  
Author(s):  
Rajib Goswami ◽  
Dhruba Kr Bhattacharyya ◽  
Malayananda Dutta ◽  
Jugal K. Kalita
Keyword(s):  
Data Warehouse ◽  
View Selection ◽  
Selection For

View selection for designing the global data warehouse

2001 ◽  
Vol 39 (3) ◽  
pp. 219-240 ◽  
Author(s):  
Dimitri Theodoratos ◽  
Spyros Ligoudistianos ◽  
Timos Sellis
Keyword(s):  
Data Warehouse ◽  
View Selection ◽  
Selection For ◽  
Global Data

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.

Materialized View Selection Using Swap Operator Based Particle Swarm Optimization

2021 ◽  
Vol 13 (1) ◽  
pp. 58-73
Author(s):  
Amit Kumar ◽  
T. V. Vijay Kumar
Keyword(s):  
Particle Swarm Optimization ◽  
Data Warehouse ◽  
Optimization Technique ◽  
Particle Swarm ◽  
Selection Problem ◽  
Data Repository ◽  
Swarm Optimization ◽  
View Selection ◽  
Particle Swarm Optimization Technique ◽  
Swap Operator

The data warehouse is a key data repository of any business enterprise that stores enormous historical data meant for answering analytical queries. These queries need to be processed efficiently in order to make efficient and timely decisions. One way to achieve this is by materializing views over a data warehouse. An n-dimensional star schema can be mapped into an n-dimensional lattice from which Top-K views can be selected for materialization. Selection of such Top-K views is an NP-Hard problem. Several metaheuristic algorithms have been used to address this view selection problem. In this paper, a swap operator-based particle swarm optimization technique has been adapted to address such a view selection problem.

A Hybrid Approach for Data Warehouse View Selection

2008 ◽  
pp. 3085-3115
Author(s):  
Biren Shah ◽  
Karthik Ramachandran ◽  
Vijay Raghavan
Keyword(s):  
Data Warehouse ◽  
Hybrid Approach ◽  
Greedy Heuristic ◽  
Materialized Views ◽  
View Selection ◽  
Materialized View Selection ◽  
Optimal Efficiency ◽  
Access Patterns ◽  
Multiple Query ◽  
Selection Of

Materialized view selection is one of the crucial decisions in designing a data warehouse for optimal efficiency. Static selection of views may materialize certain views that are not beneficial as the data and usage trends change over time. On the contrary, dynamic selection of views works better only for queries demanding a high degree of aggregation. These facts point to the need for a technique that combines the improved response time of the static approach and the automated tuning capability of the dynamic approach. In this article, we propose a hybrid approach for the selection of materialized views. The idea is to partition the collection of all views into a static and dynamic set such that views selected for materialization from the static set are persistent over multiple query (and maintenance) windows, whereas views selected from the dynamic set can be queried and/or replaced on the fly. Highly aggregated views are selected on the fly based on the query access patterns of users, whereas the more detailed static set of views plays a significant role in the efficient maintenance of the dynamic set of views and in answering certain detailed view queries. We prove that our proposed strategy satisfies the monotonicity requirements, which is essential in order for the greedy heuristic to deliver competitive solutions. Experimental results show that our approach outperforms Dynamat, a well-known dynamic view management system that is known to outperform optimal static view selection.

Sign in / Sign up

Export Citation Format

Share Document