It makes use of the different degrees
of freshness of the OLAP nodes in the cluster in order to serve such queries, which
agree to access less fresh data sooner than queries asking for the latest data. The
proposed architecture has been implemented as part of the PowerDB project at ETH
Zurich, and we conducted an extensive performance evaluation using the TPC-R
benchmark. An important result is that the system scales linearly, even if providing
clients access to up-to-date data in a database cluster with 128 nodes.
2 0 R?¶hm
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of
Idea Group Inc. is prohibited.
References
Akal, F., T??rker, C., Schek, H.-J., Breitbart, Y., Grabs, T., & Veen, L. (2005). Finegrained
replication and scheduling with freshness and correctness guarantees.
In Proceedings of the 31st VLDB Conference on Very Large Databases,
Trondheim, Norway.
Alonso, G., Blott, S., Fe??ler, A., & Schek, H.-J. (1997, May 12-14). Correctness
and parallelism of composite systems. In Proceedings of the Sixteenth ACM
SIGMOD Symposium on Principles of Database Systems (PODS), Tucson,
Arizona (pp. 197-208). ACM Press.
Baru, C. K., Fecteau, G., Goyal, A., Hsiao, H., Jhingran, A., Padmanabhan, S.,
Copeland, G. P., & Wilson, W. G. (1995). DB2 parallel edition. IBM Systems
Journal, 34(2), 292-322.
Pages:
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471