Publicação

An evolutionary approach to the selection and allocation of distributed cubes

Ver documento

Detalhes bibliográficos
Resumo:The materialization of multidimensional structures is a common way to speed up OLAP queries. Since there might be a huge number of those structures, a variety of proposals tried to select the most beneficial set, based on the profile of the queries and observing some constraints as materializing space and maintenance time, addressing a centralized storage facility. Only recently, the distributed scenario came to stage on this area, introducing the space dimension (and corresponding communication costs) into the equation to minimize costs. This paper focuses on the selection and allocation of distributed OLAP cubes, using evolutionary algorithms, having an extended aggregation lattice as framework to capture the distributed semantics. Moreover, the evaluation of the fitness of evolutionary solutions is based on cost estimation algorithms that simulate the execution of parallel tasks, using time units as cost metric.
Autores principais:Loureiro, Jorge
Outros Autores:Belo, Orlando
Assunto:Data warehousing View management Distributed OLAP and distributed OLAP
Ano:2006
País:Portugal
Tipo de documento:comunicação em conferência
Tipo de acesso:acesso restrito
Instituição associada:Universidade do Minho
Idioma:inglês
Origem:RepositóriUM - Universidade do Minho
Descrição
Resumo:The materialization of multidimensional structures is a common way to speed up OLAP queries. Since there might be a huge number of those structures, a variety of proposals tried to select the most beneficial set, based on the profile of the queries and observing some constraints as materializing space and maintenance time, addressing a centralized storage facility. Only recently, the distributed scenario came to stage on this area, introducing the space dimension (and corresponding communication costs) into the equation to minimize costs. This paper focuses on the selection and allocation of distributed OLAP cubes, using evolutionary algorithms, having an extended aggregation lattice as framework to capture the distributed semantics. Moreover, the evaluation of the fitness of evolutionary solutions is based on cost estimation algorithms that simulate the execution of parallel tasks, using time units as cost metric.