Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Efficient and Robust Node-Partitioned Data Warehouses

Efficient and Robust Node-Partitioned Data Warehouses
View Sample PDF
Author(s): Pedro Furtado (Universidade de Coimbra, Portugal)
Copyright: 2009
Pages: 20
Source title: Database Technologies: Concepts, Methodologies, Tools, and Applications
Source Author(s)/Editor(s): John Erickson (University of Nebraska, Omaha, USA)
DOI: 10.4018/978-1-60566-058-5.ch040


View Efficient and Robust Node-Partitioned Data Warehouses on the publisher's website for pricing and purchasing information.


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 nodepartitioned data warehouse (NPDW), designed to run on the low cost environment, focusing on the design for partitioning, efficient parallel join and query transformations. Given the low reliability of the target environment, we also show how replicas are incorporated in the design of a robust NPDW strategy with availability guarantees and how the replicas are used for always-on, always efficient behavior in the presence of periodic load and maintenance tasks.

Related Content

. © 2019. 19 pages.
. © 2019. 44 pages.
. © 2019. 23 pages.
. © 2019. 18 pages.
. © 2019. 11 pages.
. © 2019. 18 pages.
. © 2019. 31 pages.
Body Bottom