Data allocation in distributed database systems
ACM Transactions on Database Systems (TODS)
Vertical partitioning for database design: a graphical algorithm
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Parallel database systems: the future of high performance database systems
Communications of the ACM
Distributed and Parallel Databases
Oracle parallel processing
Multi-Dimensional Database Allocation for Parallel Data Warehouses
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
WARLOCK: A Data Allocation Tool for Parallel Warehouses
Proceedings of the 27th International Conference on Very Large Data Bases
Analysis of Dynamic Load Balancing Strategies for Parallel Shared Nothing Database Systems
VLDB '93 Proceedings of the 19th International Conference on Very Large Data Bases
Dynamic Load Balancing in Hierarchical Parallel Database Systems
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Query-Driven Data Allocation Algorithms for Distributed Database Systems
DEXA '97 Proceedings of the 8th International Conference on Database and Expert Systems Applications
Data placement in shared-nothing parallel database systems
The VLDB Journal — The International Journal on Very Large Data Bases
Experimental evidence on partitioning in parallel data warehouses
Proceedings of the 7th ACM international workshop on Data warehousing and OLAP
Allocating Fragments in Distributed Databases
IEEE Transactions on Parallel and Distributed Systems
Supporting table partitioning by reference in oracle
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Data Partitioning in Data Warehouses: Hardness Study, Heuristics and ORACLE Validation
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Parallel OLAP query processing in database clusters with data replication
Distributed and Parallel Databases
SAGA: a combination of genetic and simulated annealing algorithms for physical data warehouse design
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
DaWaK'10 Proceedings of the 12th international conference on Data warehousing and knowledge discovery
Verification of partitioning and allocation techniques on teradata DBMS
ICA3PP'11 Proceedings of the 11th international conference on Algorithms and architectures for parallel processing - Volume Part I
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
| Hi-index | 0.00 |
Traditionally, designing a parallel data warehouse consists first in fragmenting its schema and then allocating the generated fragments over the nodes of the parallel machine. The main drawback of this approach is that interdependency between fragmentation and allocation processes is not taken into account during the design phase. This interdependency is characterized by the fact that generated of fragments are one of the inputs of the allocation problem and both processes optimize the same set of queries. In this paper, we present a new approach for designing parallel relational data warehouses on a shared nothing machine, where the fragmentation and the allocation are done simultaneously. To allocate efficiently query workload over nodes, a load balancing method is given. Finally, a validation of our proposals is presented.