61-67.
202 Davis & Gupta
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission of
Idea Group Inc. is prohibited.
Wu, M. C., & Buchmann, A. (1998). Encoded bitmap indexing for data warehouses.
Proceedings of the 14th International Conference on Data Engineering, Orlando,
FL (pp. 220-230).
Efficient and Robust Node-Partitioned Data Warehouses 20
Copyright ?© 2007, Idea Group Inc. Copying or distributing in print or electronic forms without written permission
of Idea Group Inc. is prohibited.
Chapter.IX
Efficient and Robust
Node-Partitioned
Data.Warehouses
Pedro Furtado
Universidade de Coimbra, Portugal
Abstract
Running large data warehouses (DWs) efficiently over low cost platforms places
special requirements on the design of system architecture. The idea is to have the
DW on a set of low-cost nodes in a nondedicated local area network (LAN). Nodes
can run any relational database engine, and the system relies on a partitioning
strategy and query processing middle layer. These characteristics are in contrast
with typical parallel database systems, which rely on fast dedicated interconnects
and hardware, as well as a specialized parallel query optimizer for a specific database
engine. This chapter describes the architecture of the node-partitioned data
warehouse (NPDW), designed to run on the low cost environment, focusing on the
design for partitioning, efficient parallel join and query transformations.
Pages:
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389