SEARCH
0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Prev | Current Page 406 | Next

Robert Wrembel and Christian Koncilia

"Data Warehouses and Olap: Concepts, Architectures and Solutions"

In practice, this cost model is replaced by evaluating the cost
of operations as our simulator described next does.
Efficient and Robust Node-Partitioned Data Warehouses 2
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission
of Idea Group Inc. is prohibited.
Comparative.Analysis. of.................
Partitioning.Alternatives
The partitioning strategies described before can be characterized as more replication-
oriented (PRS, PFRD-H) and more partitioning-oriented (WBP, WBP+JB)
ones. Partitioning-oriented strategies are very efficient in an environment with fast
interconnections and available bandwidth, because repartitioning is cheap in those
environments. On the other hand, the advantage of PRS (and PFRD-H) is that it
places lower requirements on the interconnections, with fewer data exchange requirements.
However, the drawback is the size of replicated relations that must be
processed in every node. Our comparative analysis is based both on a simulator
environment, to test several possible configurations (e.g., number of nodes, available
bandwidth) and actual executions to help validate the results and analyze the
strategies for TPC-H query set.
We have built a discrete-event simulation environment, which uses a basic set of
parameters listed in Figure 8. The simulator estimates the cost of individual operations
that need to be performed to execute the query.


Pages:
394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418