首页 | 本学科首页   官方微博 | 高级检索  
     检索      

并行查询中的索引并行化技术
引用本文:王多强,刘金根,李庆华,睢海燕.并行查询中的索引并行化技术[J].华中科技大学学报(自然科学版),2003,31(1):13-15.
作者姓名:王多强  刘金根  李庆华  睢海燕
作者单位:华中科技大学计算机科学与技术学院
摘    要:提出一种新的索引并行化技术,利用多处理机来提高建立在B树结构上的索引性能,并提出了一种改进的B树结构-FALNB树,基于该树结构,以大结点B树方式在多个处理机上分布索引数据,通过动态调整算法快速进行调整,取得很好的负载平衡效果,给出了时间分析模型,实验结果显示FALNB树能加快查询响应速度,对海量数据的索引有良好性能。

关 键 词:并行查询  索引并行化  并行索引  并行B树  FALNB树  并行处理  并行关系数据库系统  多处理机
文章编号:1671-4512(2003)01-0013-03
修稿时间:2002年2月1日

The index parallelization techonology in the parallel query
Wang Duoqiang,Liu Jingen,Li Qinghua,Sui Haiyan.The index parallelization techonology in the parallel query[J].JOURNAL OF HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY.NATURE SCIENCE,2003,31(1):13-15.
Authors:Wang Duoqiang  Liu Jingen  Li Qinghua  Sui Haiyan
Abstract:This paper presented a new improved index parallelization technology to improve the performance of index constructed on the structure of B tree by using multi processors. An improved structure of B tree called FALNB tree was put forward. On the basis of this tree structure, the index data was distributed among multi processors by using large node B tree method. The unbalance during process can be quickly adjusted by means of a dynamical adjusting algorithm. As a result, a good balance of load was achieved. The paper proposed a time model for analysis. The experimental results confirm that the query performance was improved as the response time was reduced by the FALNB tree, especially for the index of massive data.
Keywords:parallel index  B  tree  FALNB  tree  parallel processing  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号