A Compound Parallel Btree for High Scalability and Availability on Chained Declustering Parallel Systems
A Compound Parallel Btree for High Scalability and Availability on Chained Declustering Parallel Systems
复制标题
DOI：
10.1587/transinf.e94.d.587
复制
发表时间：
2011-03
期刊：
影响因子：
--
通讯作者：
M. Luo;Akitsugu Watanabe;H. Yokota
中科院分区：
文献类型：
--
作者：
M. Luo;Akitsugu Watanabe;H. Yokota
可扩展性和可用性是并行数据库系统的关键特征。为了实现可伸缩性，许多动态负载平衡方法，数据放置和并行索引结构上的共享无并行基础设施已被提出。使用并行Btree的范围分区放置的数据迁移是一种解决方案。范围分区和链式分散副本的组合提供了高可用性（HA），同时保持了可伸缩性。但是，在每个节点中独立处理主数据和备份数据需要较长的故障转移时间。我们提出了一种新的方法，使用一个并行的Btree，称为脂肪Btree的链式去聚类副本的复合治疗。在所提出的方法中，一个单一的胖B树提供的所有处理器元件（PE）的主要和备份数据的访问路径，这大大减少了故障转移时间。此外，这些访问路径在两个相邻PE之间重叠，这使得能够通过动态重定向访问路径来实现动态负载平衡，而无需物理数据迁移。此外，这种复合处理提高了内存空间利用率，使索引处理具有良好的可伸缩性。在一个160节点的PC集群上使用PostgreSQL的实验证明了我们提出的方法的高扩展性和可用性的有效性。
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 Post-greSQL on a 160-node PC cluster demonstrate the effectiveness of the high scalability and availability of our proposed method.