The view selection problem for XML content based routing

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.

Download Full-text

Using Shuffled Frog Leaping Algorithm to View Selection Problem Subject to Dual Constraints

2018 4th Annual International Conference on Network and Information Systems for Computers (ICNISC) ◽

10.1109/icnisc.2018.00046 ◽

2018 ◽

Author(s):

Chen Yu-Si ◽

Sun Lin-Fu

Keyword(s):

Selection Problem ◽

Shuffled Frog Leaping Algorithm ◽

View Selection ◽

Shuffled Frog Leaping ◽

Dual Constraints

Download Full-text

A Hybrid Approach To Solving The View Selection Problem In Data Warehouse

International Journal of Computer Sciences and Engineering ◽

10.26438/ijcse/v6i9.270275 ◽

2018 ◽

Vol 6 (9) ◽

pp. 270-275

Author(s):

Mohammed El Alaoui ◽

Karim El Moutaouakil ◽

Mohamed Ettaouil

Keyword(s):

Data Warehouse ◽

Hybrid Approach ◽

Selection Problem ◽

View Selection

Download Full-text

Multi-Objective Materialized View Selection Using Improved Strength Pareto Evolutionary Algorithm

International Journal of Artificial Intelligence and Machine Learning ◽

10.4018/ijaiml.2019070101 ◽

2019 ◽

Vol 9 (2) ◽

pp. 1-21

Author(s):

Jay Prakash ◽

T. V. Vijay Kumar

Keyword(s):

Evolutionary Algorithm ◽

Selection Problem ◽

Maintenance Cost ◽

Materialized Views ◽

Trade Off ◽

View Selection ◽

Materialized View ◽

Strength Pareto Evolutionary Algorithm ◽

Materialized View Selection ◽

Selection Of

A data warehouse system uses materialized views extensively in order to speedily tackle analytical queries. Considering that all possible views cannot be materialized due to maintenance cost and storage constraints, the selection of an appropriate set of views to materialize that achieve an optimal trade-off among query response time, maintenance cost, and the storage constraint becomes an essential necessity. The selection of such an appropriate set of views for materialization is referred to as the materialized views selection problem, which is an NP-Complete problem. In the last two decades, several new selection approaches, based on heuristics, have been proposed. Most of these have used a single objective or weighted sum approach to address the various constraints. In this article, an attempt has been made to address the bi-objective materialized view selection problem, where the objective is to minimize the view evaluation cost of materialized views and the view evaluation cost of the non-materialized views, using the Improved Strength Pareto Evolutionary Algorithm. The experimental results show that the proposed multi-objective view selection algorithm is able to select the Top-K views that achieves a reasonable trade-off between the two objectives. Materializing these selected views would reduce the query response times for analytical queries and thereby facilitates the decision-making process.

Download Full-text

Materialized Views in Multidimensional Databases

Multidimensional Databases ◽

10.4018/978-1-59140-053-0.ch008 ◽

2003 ◽

pp. 222-251 ◽

Cited By ~ 1

Author(s):

Stefano Paraboschi ◽

Giuseppe Sindoni ◽

Elena Baralis ◽

Ernst Teniente

Keyword(s):

Data Models ◽

Selection Problem ◽

Materialized Views ◽

Incremental Maintenance ◽

View Selection ◽

Materialized View ◽

Multidimensional Databases ◽

Maintenance Techniques ◽

Definition Of

This chapter presents materialized views in the context of multidimensional databases (MDDBs). A materialized view is a view whose content is explicitly stored in the database. The advantage of materializing views is that it is not necessary to recompute the query every time the view is accessed. The shortcoming is that it has to be kept consistent with the updates on the base tables. However, efficient incremental maintenance techniques have been proposed. MDDBs are an ideal environment for materialized views because frequency of updates is low, MDDB data models permit easy adoption of incremental maintenance, and queries can be modeled in such a way to allow an easy definition of the view selection problem, i.e., the problem of selecting which query to materialize in an MDDB. Hence, we present the problems of choosing and maintaining materialised views with the corresponding solutions.

Download Full-text