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 423 | Next

Robert Wrembel and Christian Koncilia

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

In the second half of the chapter, we discuss query
routing algorithms and freshness-aware scheduling. This protocol enables users to
seamlessly decide how fresh the data analysed should be by allowing for different
degrees of freshness of the online analytical processing (OLAP) nodes. In particular
it becomes then possible to trade freshness of data for query performance.
OLAP with a Database Cluster 2
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission
of Idea Group Inc. is prohibited.
Introduction
Online analytical processing (OLAP) systems must cope with huge volumes of data
and at the same time must allow for short response times to facilitate interactive
usage. They must also be capable to scale, meaning to be easily extensible with the
increasing data volumes accumulated. Furthermore, the requirement that the data
analysed should be up-to-date is becoming more and more important. However, not
only are these contrary requirements, but they also run counter to the performance
needs of the day-to-day business.
Most OLAP systems nowadays are kept separated from mission critical systems.
This means that they offer a compromise between ???up-to-dateness,??? that is, freshness
(or currency) of data, and query response times. The data needed are propagated
into the OLAP system on a regular basis, preferably when not slowing down
day-to-day business, for example, during nights or weekends.


Pages:
411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435