The continuous growth of OLAP users and data impose additional stress on data management and hardware infrastructure. The distribution of multidimensional data through a number of servers allows the increasing of storage and processing power without an exponential increase of financial costs. But this solution adds another dimension to the problem: space. Even in centralized OLAP, cube selection efficiency is complex, but now, we must also know where to materialize subcubes. This paper proposes algorithms that solve the distributed OLAP selection problem under space constraints, considering a query profile, using discrete particle swarm optimization in its normal, cooperative, multi-phase and hybrid genetic versions.The work of Jorge Lourei...
Summarization: This paper presents a new hybrid algorithm, which is based on the concepts of Particl...
Abstract — This paper proposes the use of a Swarm Intelligence based approach (SITA) for Task Alloca...
The problem addressed here is to orthogonally pack a given set of box shaped items into the minimum ...
Multidimensional analysis supported by Online Analytical Processing (OLAP) systems demands for many ...
The use of materialized views is a common technique to speed up on-line analytical processing. Howev...
In OLAP, the materialization of multidimensional structures is a sine qua non condition of performan...
OLAP queries are characterized by short answering times. Materialized cube views, a pre-aggregation ...
The materialization of multidimensional structures is a common way to speed up OLAP queries. Since t...
The materialization of multidimensional structures is a sine qua non condition of performance for OL...
OLAP systems depend heavily on the materialization of multidimensional structures to speed-up querie...
AbstractStorage of pre-computed views in data warehouse can essentially reduce query processing cost...
The materialization of multidimensional structures is a common way to speed up mostly aggregation qu...
[[abstract]]Ant colony optimization (ACO) and particle swarm optimization (PSO) are two popular algo...
. Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve op...
Summarization: This paper introduces a new algorithmic nature inspired approach that uses a hybridiz...
Summarization: This paper presents a new hybrid algorithm, which is based on the concepts of Particl...
Abstract — This paper proposes the use of a Swarm Intelligence based approach (SITA) for Task Alloca...
The problem addressed here is to orthogonally pack a given set of box shaped items into the minimum ...
Multidimensional analysis supported by Online Analytical Processing (OLAP) systems demands for many ...
The use of materialized views is a common technique to speed up on-line analytical processing. Howev...
In OLAP, the materialization of multidimensional structures is a sine qua non condition of performan...
OLAP queries are characterized by short answering times. Materialized cube views, a pre-aggregation ...
The materialization of multidimensional structures is a common way to speed up OLAP queries. Since t...
The materialization of multidimensional structures is a sine qua non condition of performance for OL...
OLAP systems depend heavily on the materialization of multidimensional structures to speed-up querie...
AbstractStorage of pre-computed views in data warehouse can essentially reduce query processing cost...
The materialization of multidimensional structures is a common way to speed up mostly aggregation qu...
[[abstract]]Ant colony optimization (ACO) and particle swarm optimization (PSO) are two popular algo...
. Ant Colonies (AC) optimization take inspiration from the behavior of real ant colonies to solve op...
Summarization: This paper introduces a new algorithmic nature inspired approach that uses a hybridiz...
Summarization: This paper presents a new hybrid algorithm, which is based on the concepts of Particl...
Abstract — This paper proposes the use of a Swarm Intelligence based approach (SITA) for Task Alloca...
The problem addressed here is to orthogonally pack a given set of box shaped items into the minimum ...