| 一种新的分布式并行索引树——DPB^＋-Tree |
| |
| 引用本文： | 唐继勇 白新跃 杨峰 何建. 一种新的分布式并行索引树——DPB^＋-Tree[J]. 计算机科学, 2005, 32(12): 75-78 |
| |
| 作者姓名： | 唐继勇 白新跃 杨峰 何建 |
| |
| 作者单位： | 电子科技大学自动化学院,成都,610054 |
| |
| 摘 要： | 随着数据规模的增大,查询越来越复杂,分布式并行索引以其高性能而逐渐成为解决复杂查询问题的有效手段。本文提出一种适合于分布式并行的新索引树结构——DPB~ -Tree,该索引树以B~ 树和 hash结构为基础,其叶子结点被组织为有n个散列表元的hash表链,从树的根结点到叶子结点,结点副本数量逐渐减少,并且其数量的变化是动态的。对DPB~ -Tree响应时间的仿真结果表明 DPB~ -Tree系统提高了系统的查询效率,与其它相关策略,如CPB方法比较具有较明显优势。
|
| 关 键 词： | 分布式并行索引 B~ 树 hash 结构 DPB~ -Tree |
DPB+ -Tree--A New Distributed and Paralleling Index Tree |
| |
| TANG Ji-Yong,BAI Xin-Yue,YANG Feng,HE Jian (School of Automation,University of Electronic Science and Technology of Chin,Chengdu. DPB+ -Tree--A New Distributed and Paralleling Index Tree[J]. Computer Science, 2005, 32(12): 75-78 |
| |
| Authors: | TANG Ji-Yong BAI Xin-Yue YANG Feng HE Jian (School of Automation University of Electronic Science Technology of Chin Chengdu |
| |
| Affiliation: | School of Automation, University of Electronic Science and Technology of China, Chengdu 610054 |
| |
| Abstract: | Along with the continuously extending of the number of data, the search operations become more and more complicated. The distributed and parallel index gradually become the valid means of resolving this complicated problem because its high performance. Th |
| |
| Keywords: | Distributed and parallel index B~ -Tree Hash structure DPB~ -Tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机科学》浏览原始摘要信息 |
|
点击此处可从《计算机科学》下载全文 |
|
