A Compound Parallel Btree for High Scalability and Availability on Chained Declustering Parallel Systems

Min LUO  Akitsugu WATANABE  Haruo YOKOTA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E94-D   No.3   pp.587-601
Publication Date: 2011/03/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Section on Data Engineering)
Category: 
Keyword: 
parallel Btree,  scalability,  availability,  chained declustering,  

Full Text: PDF
>>Buy this Article


Summary: 
Scalability and availability are the key features of parallel database systems. To realize scalability, many dynamic load-balancing methods with data placement and parallel index structures on shared-nothing parallel infrastructure have been proposed. Data migration with range-partitioned placement using a parallel Btree is one solution. The combination of range partitioning and chained declustered replicas provides high availability (HA) while preserving scalability. However, independent treatment of the primary and backup data in each node requires long failover times. We propose a novel method for the compound treatment of chained declustered replicas using a parallel Btree, termed the Fat-Btree. In the proposed method, a single Fat-Btree provides access paths to both the primary and backup data of all processor elements (PEs), which greatly reduces failover time. Moreover, these access paths overlap between two neighboring PEs, which enables dynamic load balancing without physical data migration by dynamically redirecting the access paths. In addition, this compound treatment improves memory space utilization to enable index processing with good scalability. Experiments using PostgreSQL on a 160-node PC cluster demonstrate the effectiveness of the high scalability and availability of our proposed method.