Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments

Derakhshan, Roozbeh; Stantić, Bela; Korn, Othmar; Dehne, Frank

doi:10.1007/978-3-540-69501-1_14

Cited by 45 publications

(44 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Randomize algorithms such as simulated annealing algorithms [7,8,14] and genetic algorithms [5,13,18,30,16] have been used and explored for the selection of materialized views in order to improve the quality of the solution. These algorithms use a randomized search strategy for deciding which views to materialize.…”

Section: Randomized Algorithms Based Methodsmentioning

confidence: 99%

“…We have implemented our approach and compared it with a randomized method because in previous studies [30,7,8], it was shown that randomized algorithms provide a significant improvement in the performance compared to deterministic algorithms. The most commonly used randomized algorithms in the context of view selection are simulated annealing algorithms and genetic algorithms.…”

Section: Experimental Evaluationmentioning

confidence: 99%

“…Although, several heuristic algorithms have been proposed in literature to solve the view selection problem such as deterministic algorithms i.e., greedy algorithms [11,29,12,25,20,21,26,2], randomized algorithms i.e., genetic algorithms [31,18,13,30,16,5] and simulated annealing algorithms [14,7,8] or hybrid algorithms [32] which combine the strategies of pure deterministic algorithms and pure randomized algorithms.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Modeling View Selection as a Constraint Satisfaction Problem

Mami

Coletta

Bellahsène

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Using materialized views can highly speed up the query processing time. This paper deals with the view selection issue, which consists in finding a set of views to materialize that minimizes the expected cost of evaluating the query workload, given a limited amount of resource such as total view maintenance cost and/or storage space. However, the solution space is huge since it entails a large number of possible combinations of views. For this matter, we have designed a solution involving constraint programming, which has proven to be a powerful approach for modeling and solving combinatorial problems. The efficiency of our method is evaluated using workloads consisting of queries over the schema of the TPC-H benchmark. We show experimentally that our approach provides an improvement in the solution quality (i.e., the quality of the obtained set of materialized views) in term of cost saving compared to genetic algorithm in limited time. Furthermore, our approach scales well with the query workload size.

show abstract

Section: Randomized Algorithms Based Methodsmentioning

confidence: 99%

Section: Experimental Evaluationmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Modeling View Selection as a Constraint Satisfaction Problem

Mami

Coletta

Bellahsène

2011

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Another using of simulated annealing for materialized view selection has been proposed in [11] in which a parallel simulated annealing algorithm selecting views from an input MVPP. Although the combination of parallel simulated annealing and MVPP has been resulted in increasing the quality of obtained set of materialized views and improving the query processing time and decreasing view maintenance cost, it trapped to local minimum in some cases.…”

Section: Related Workmentioning

confidence: 99%

http://www.jcomputers.us/vol11/jcp1102-06.pdf

Sohrabi¹,

Ghods²

2016

JCP

View full text Add to dashboard Cite

Data warehouses are subject oriented, consolidated, integrated, and time variant repository of possibly heterogeneous data. A data warehouse is used to response to on-line analytical queries over the millions records of data in an acceptable time. Since a data warehouse often has millions of records of data, it is an important challenge how we can reduce the time of on-line analytical processing. One of the most important issues which address this problem is the view materialization. Each sub-query results an intermediate table, called virtual view, which is used to find final result of the analytical query. These virtual views often are commonly used to response to several analytical queries. We can materialize such views to prevent multiple redundant computations and thus lead to reduction in response time of queries. The constraint of storage memory on one hand, and the maintenance cost of materialized views when the source data are updated on the other hand, cause that it is impossible to materialize all or even large part of views. Therefore, selection of a proper set of views to materialization plays a major role in performance. There are many methods of view selection to materialization which uses different techniques and frameworks to select optimal set of views to materialization. In this paper, we present a new efficient method to conduct selecting proper set of views to materialization using a frequent itemset mining approach. In our algorithm, the set of given queries is transformed to a transaction database where a transaction corresponds to a query and items of a transaction are the original query's predicates. Our performance study showed that this algorithm outperformed substantially the best former algorithms.Key words: Data warehouse, on-line analytical processing (OLAP), view selection, view materialization, frequent itemset mining.

show abstract

“…Também podem existir vários níveis intermediários entre os níveis superior e inferior, representando graus crescentes de agregação (Agrawal et al, 2000;Baralis et al, 1997;Derakhshan et al, 2008;Gupta e Mumick, 1999;Harinarayan et al, 1996;Hung et al, 2007;Kotidis e Roussopoulos, 2001;Lawrence e Rau-Chaplin, 2006;Shah et al, 2006).…”

Section: Níveis De Agregaçãounclassified

Processamento de consultas SOLAP drill-across e com junção espacial em data warehouses geográficos

Brito¹

View full text Add to dashboard Cite

Parallel Simulated Annealing for Materialized View Selection in Data Warehousing Environments

Cited by 45 publications

References 15 publications

Modeling View Selection as a Constraint Satisfaction Problem

Modeling View Selection as a Constraint Satisfaction Problem

http://www.jcomputers.us/vol11/jcp1102-06.pdf

Processamento de consultas SOLAP drill-across e com junção espacial em data warehouses geográficos

Contact Info

Product

Resources

About