Data warehouse queries pose challenging performance problems that often necessitate the use of parallel database systems (PDBS). Although dynamic load balancing is of key importance in PDBS, to our knowledge it has not yet been investigated thoroughly for parallel data warehouses. In this study, we propose a scheduling strategy that simultaneously considers both processors and disks while utilizing the load balancing potential of a Shared Disk architecture. We compare the performance of this new method to several other approaches in a comprehensive simulation study, incorporating skew aspects and typical data warehouse features such as star schemas
Designing a Parallel Relational Data Warehouse (PRDW) consists of a set of tasks: (i) choosing the h...
Abstract: In-memory database management systems have the potential to reduce the execution time of c...
A consensus on parallel architecture for very large database management has emerged. This architectu...
Data warehouse queries pose challenging performance problems that often necessitate the use of paral...
Dynamic load balancing is a prerequisite for effectively utilizing large parallel database systems. ...
Parallel database systems have to support the effective parallelization of complex queries in multi-...
International audienceDefinition : The goal of parallel query execution is minimizing query response...
In this paper, we investigate two scheduling approaches for multicomputer-based parallel database sy...
This paper presents a multidimensional schema, called the multidimensional range tree (MDR-tree), to...
Amount of data stored in enterprises are increasing rapidly. Volume of data stored in database is ap...
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that c...
Parallel database systems have to support the effective parallelization of complex queries in multi-...
We consider the execution of multi-join queries in a hierarchical parallel system, i.e., a shared-no...
In shared-disk database systems, disk access has to be scheduled properly to avoid unnecessary conte...
© Springer-Verlag Berlin Heidelberg 1997.In this study, we develop a new static scheduling scheme wh...
Designing a Parallel Relational Data Warehouse (PRDW) consists of a set of tasks: (i) choosing the h...
Abstract: In-memory database management systems have the potential to reduce the execution time of c...
A consensus on parallel architecture for very large database management has emerged. This architectu...
Data warehouse queries pose challenging performance problems that often necessitate the use of paral...
Dynamic load balancing is a prerequisite for effectively utilizing large parallel database systems. ...
Parallel database systems have to support the effective parallelization of complex queries in multi-...
International audienceDefinition : The goal of parallel query execution is minimizing query response...
In this paper, we investigate two scheduling approaches for multicomputer-based parallel database sy...
This paper presents a multidimensional schema, called the multidimensional range tree (MDR-tree), to...
Amount of data stored in enterprises are increasing rapidly. Volume of data stored in database is ap...
Clusters are now composed of non-uniform nodes with different CPUs, disks or network cards so that c...
Parallel database systems have to support the effective parallelization of complex queries in multi-...
We consider the execution of multi-join queries in a hierarchical parallel system, i.e., a shared-no...
In shared-disk database systems, disk access has to be scheduled properly to avoid unnecessary conte...
© Springer-Verlag Berlin Heidelberg 1997.In this study, we develop a new static scheduling scheme wh...
Designing a Parallel Relational Data Warehouse (PRDW) consists of a set of tasks: (i) choosing the h...
Abstract: In-memory database management systems have the potential to reduce the execution time of c...
A consensus on parallel architecture for very large database management has emerged. This architectu...