一种改进的数据库Sharding方法
发布时间：2018-09-13 05:51
【摘要】：Sharding是用于开源数据库的一种水平扩展解决方案,包含两个主要步骤:逻辑划分和物理映射.对于前者,现有机制通常根据Shard Key采取基于Range或是Hash的方式来实现.然而,基于Range的方法不能够保证数据值域的均衡;基于Hash的方法不适用于范围查询,且当Shard Key不均匀时无法保证数据量的均衡.对于后者,现有机制通常采用一致性哈希来确保存储节点的动态扩展,然而该方法并未考虑数据增减导致Chunk大小变化时的数据均衡机制.为此,提出一种新的负载均衡的Sharding方法:一方面综合考虑上述两种划分方式的优缺点提出一种新的逻辑划分方法,另一方面给出一种Chunk大小变化而导致的不均衡处理机制.实验证明本文提出的方法能够有效保证数据的负载均衡.
[Abstract]:Sharding is a horizontal extension solution for open source databases, which consists of two main steps: logical partitioning and physical mapping. For the former, the existing mechanism is usually based on Range or Hash based on Shard Key. However, the method based on Range can not guarantee the equilibrium of data range, and the method based on Hash is not suitable for range query, and can not guarantee the balance of data when Shard Key is not uniform. For the latter, the existing mechanism usually uses consistent hash to ensure the dynamic expansion of storage nodes. However, the method does not consider the data equalization mechanism when the data increase or decrease results in the change of Chunk size. Therefore, a new load balancing Sharding method is proposed. On the one hand, considering the advantages and disadvantages of the above two partitioning methods, a new logic partition method is proposed. On the other hand, a mechanism for dealing with the imbalance caused by the change of Chunk size is given. Experiments show that the proposed method can effectively ensure the load balance of the data.
【作者单位】： 东北大学计算机科学与工程学院;东北大学软件学院;
【基金】：国家自然科学基金项目(612020888)资助 中央高校基本科研业务费专项基金项目(100704001)资助 教育部高等学校博士学科点专项科研基金项目(20120042110028)资助
【分类号】：TP311.13
本文编号：2240269
[Abstract]:Sharding is a horizontal extension solution for open source databases, which consists of two main steps: logical partitioning and physical mapping. For the former, the existing mechanism is usually based on Range or Hash based on Shard Key. However, the method based on Range can not guarantee the equilibrium of data range, and the method based on Hash is not suitable for range query, and can not guarantee the balance of data when Shard Key is not uniform. For the latter, the existing mechanism usually uses consistent hash to ensure the dynamic expansion of storage nodes. However, the method does not consider the data equalization mechanism when the data increase or decrease results in the change of Chunk size. Therefore, a new load balancing Sharding method is proposed. On the one hand, considering the advantages and disadvantages of the above two partitioning methods, a new logic partition method is proposed. On the other hand, a mechanism for dealing with the imbalance caused by the change of Chunk size is given. Experiments show that the proposed method can effectively ensure the load balance of the data.
【作者单位】： 东北大学计算机科学与工程学院;东北大学软件学院;
【基金】：国家自然科学基金项目(612020888)资助 中央高校基本科研业务费专项基金项目(100704001)资助 教育部高等学校博士学科点专项科研基金项目(20120042110028)资助
【分类号】：TP311.13
【相似文献】
相关期刊论文 前2条
1 吕学强,陈文亮,姚天顺;基于连接文法的双语E-Chunk获取方法[J];东北大学学报;2002年09期
2 许广永;薛静;张建军;;企业网络运行与建构中的动态均衡[J];长春工业大学学报(社会科学版);2012年04期
相关会议论文 前2条
1 刘昱;陈红;王珊;;基于Chunk的缓存优化与管理[A];第二十一届中国数据库学术会议论文集（技术报告篇）[C];2004年
2 卢艳民;焦有章;陈红;;基于语义Chunk的动态实体化视图技术[A];第二十二届中国数据库学术会议论文集（研究报告篇）[C];2005年
相关硕士学位论文 前2条
1 张振明;基于热发布与动态平滑扩容的机票代购系统的设计与实现[D];哈尔滨工业大学;2016年
2 吴永行;财经问答系统问句解析预处理子系统的设计与实现[D];哈尔滨工业大学;2015年
，本文编号：2240269
本文链接：https://www.wllwen.com/kejilunwen/ruanjiangongchenglunwen/2240269.html
