节点文献
基于数据网格环境的连接操作算法
Join Algorithm Based on Data Grid
【Author】 YANG Dong-Hua~1,LI Jian-Zhong~(1,2),and ZHANG Wen-Ping~1 1(School of Computer Science and Technology,Harbin Institute of Technology,Harbin 150001) 2(School of Computer Science and Technology,Heilongjiang University,Harbin 150080)
【机构】 哈尔滨工业大学计算机科学与技术学院; 黑龙江大学计算机科学技术学院;
【摘要】 数据网格是一种分布式数据管理体系结构,能够为分布在网格中的资源提供协同的管理机制.数据库管理系统在数据网格中发挥着重要作用,在各种数据库操作中,连接操作是一种最常用也是最耗时的操作,到目前为止,尚未有文献提出数据网格环境下的连接操作算法.主要对数据网格环境下海量数据的连接操作算法进行了研究,针对网格中各结点之间网络带宽异构的特点,采取关系缩减算法、行分块传输技术和流水线并行机制来减少查询的响应时间.理论分析和实验结果证明,算法在减少网络通信开销、增加I/O和CPU并行、降低响应时间方面具有较好的性能.
【Abstract】 Data grid is a distributed architecture for data management,which could provide the coordinated management mechanisms for data distributed across remote resources and form a single,virtual environment for data access,management and process by integrating many data sets distributed in the network. Database management system acts as an important role on data grid.In all kinds of database operations, join operation is a common-used and complex operation that needs much more time to complete than other operations.The join algorithm of massive data on data grid is studied in this paper.The proposed algorithm uses relation reduction algorithm,row blocking technique,and pipelined parallelism to solve the problem of heterogeneity of network bandwidth between nodes on data grid.The analysis and experimental results show that the performance of the algorithm is good in minimizing the response time by decreasing network transmission cost and increasing parallelism of I/O and CPU.
【Key words】 data grid; join operation; relation reduction algorithm; pipelined parallelism;
- 【会议录名称】 第二十一届中国数据库学术会议论文集(研究报告篇)
- 【会议名称】第二十一届中国数据库学术会议
- 【会议时间】2004-10-14
- 【会议地点】中国福建厦门
- 【分类号】TP311.13
- 【主办单位】中国计算机学会数据库专业委员会