期刊文献+

基于DPB^+-Tree的索引复制策略研究 被引量:3

Index Replication Strategy Study Based on DPB^+ -Tree
下载PDF
导出
摘要 索引复制是分布并行数据库提供并行性和提高可用性的一个重要手段。本文提出一种适合于索引复制的树结构——DPB^+-Tree,在此基础上研究了相关的索引复制策略,其中副本复制原则考虑了更新/检索比、节点机负载和可靠性需求;索引副本建立允许一个新的副本学习先前的副本;而索引副本更新基于搜索更新机制来完成。对DPB^+-Tree 索引复制策略的仿真实验结果表明,副本对查询的响应性能和负载均衡度有明显改善。 Index replication is an important approach that provides parallel and improves usability of distributed parallel databas. This paper presents a new tree structure - DPB^+-Tree, which is fit for index replication. Then we research the index replication strategy based on DPB^+-Tree. The replica duplicating principle includes update/search ratio, machine load and reliability requirement. The replica producing can learn from an old one and the replica updating based on search and update mechanism of DPB^+-Tree. The simulation results of index replication strategy demonstrate that replica can improve searchresponse characteristic and load balance.
出处 《计算机科学》 CSCD 北大核心 2005年第11期112-114,共3页 Computer Science
关键词 索引复制 DPB^+-Tree 复制原则 副本建立 副本更新 索引 复制 策略研究 更新机制 并行数据库 Index replication, DPB^+-Tree, Duplicating principle, Replica producing, Replica updating
  • 相关文献

参考文献10

  • 1Yokota H, Kanemasa Y, Miyazaki J. Fat-Btree: An update-conscious parallel direc tory structure. In: 15th Int. Conf. on Data Engineering. Sydney, Australia, 1999. 448-457.
  • 2omet D. Replicated Indexes for Distributed Data. In:Proc. of the Fourth Intl. Conf. on Parallel and Distributed Information Systems. Miami Beach,Florida,USA,1996. 108-119.
  • 3Devine R. Design and Implementation of DDH: Distributed Dynamic Hashing. In:Proc. of the 4th Int. Conf. on Foundations of Data Organization on Algorithms (FODO'93). Chicago, Illinois,1993. 101-114.
  • 4Litwin W, Neimat M-A, Schneider D. Linear Hashing for Distributed Files. In: Proc. ACM SIGMOD Conf. Washington, D. C,1993.327-336.
  • 5Vingralek R,Breitbart Y, Weikum G. Distributed File Organization with Scaleable Cost/Performance. In: Proc. ACM SIGMOD Conf. Minneapolis, MN, 1994. 253-264.
  • 6Kroll B,Widmayer P. Distributing a Search Tree Among a Growing Number of Processors. In: Proc. ACM SIGMOD Conf. Minneapolis,MN, 1994. 265-276.
  • 7Seeger B, Larson P. Multi-Disk B-trees. In: Proc. of ACM SIGMOD Conf. 1991. 436-445.
  • 8Litwin W,Neimat M A, Schneider D A. RP*: A Family of Order-Preserving Scalable Distributed Data Structures. In: Proc. of VLDB' 94. 1994,342-353.
  • 9Johnoson T, Krishna P. Lazy Updates for Distributed Search Structure. In: Proc. ACM SIGMOD Conf. Washington, D. C,1993. 337-346.
  • 10Lomet D,Salzberg B. Access Method Concurrency with Recovery. In:Proc. ACM SIGMOD Conf. San Diego,CA,1992. 351-360.

同被引文献11

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部