To ensure this is the responsibility
of the coordination middleware (R?¶hm et al., 2002).
Performance. Evaluation
Let us finally have a short look at the performance characteristics of the presented
query routing and update propagation algorithms. In the following, we report on
results of an experimental evaluation of a prototype implementation as part of the
PowerDB project at ETH Zurich using the TPC-R benchmark on a large cluster of
128 nodes (R?¶hm et al., 2002). We proceed as follows: First, we quantify the performance
improvement one can achieve with different query routing algorithms.
Then, we explore the overall performance and scalability of FAS. We are especially
interested in the influence of different freshness requirements on the query and update
performance in the cluster.
Evaluation.Setup
The prototype comprises a database cluster, one designated OLTP node, the coordinator,
and a client simulator. The evaluation has been conducted on a database
cluster consisting of 128 PCs (1 GHz Pentium III, 256 MBytes RAM, and 2 SCSI
hard disks) each running Microsoft SQL Server 2000 under Windows 2000 Advanced
Server. We generated the databases according to the TPC-R benchmark
with a scaling factor 1 (size including indexes about 2 GB). The master node, the
global log, and the client simulator are Pentium II 400 MHz machines with the
same software configuration.
Pages:
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466