FAS - A Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components

Title FAS - A Freshness-Sensitive Coordination Middleware for a Cluster of OLAP Components
Author(s) U. Röhm, K. Böhm, H.-J. Schek, H. Schuldt
Type inproceedings
Booktitle Proceedings of the 28th International Conference on Very Large Data Bases (VLDB2002)
Hong Kong, China
Month August 20-23
Year 2002


Data warehouses offer a compromise between freshness of data and query evaluation times. However, a fixed preference ratio between these two variables is too undifferentiated. With our approach, clients submit a query together with an explicit 'freshness limit' as a new Quality-of-Service parameter. Our architecture is a cluster of databases. The contribution of this article is the design, implementation, and evaluation of a coordination middleware. It schedules and routes updates and queries to cluster nodes, aiming at a high throughput of OLAP queries. The core of the middleware is a new protocol called FAS (Freshness-Aware Scheduling) with the following qualitative characteristics: (1) The requested freshness limit of queries is always met, and (2) data accessed within a transaction is consistent, independent of its freshness. Our evaluation shows that FAS has the following nice properties: OLAP query-evaluation times are close (within 10%) to the ones of an idealistic setup with no updates. FAS allows to effectively trade 'up-to-dateness' for query performance. Even when all queries request fresh data, FAS clearly outperforms synchronous replication. Finally, mean response times are independent of the cluster size (up to 128 nodes).

You can directly download a PDF (833 KB) version of this paper.
!!! Dieses Dokument stammt aus dem ETH Web-Archiv und wird nicht mehr gepflegt !!!
!!! This document is stored in the ETH Web archive and is no longer maintained !!!