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

存储容量可扩展区块链系统的高效查询模型
引用本文:贾大宇,信俊昌,王之琼,郭薇,王国仁. 存储容量可扩展区块链系统的高效查询模型[J]. 软件学报, 2019, 30(9): 2655-2670
作者姓名:贾大宇  信俊昌  王之琼  郭薇  王国仁
作者单位:东北大学 计算机科学与工程学院, 辽宁 沈阳 110819,东北大学 计算机科学与工程学院, 辽宁 沈阳 110819;辽宁省大数据管理与分析重点实验室, 辽宁 沈阳 110819,东北大学 中荷生物医学与信息工程学院, 辽宁 沈阳 110819,沈阳航空航天大学 计算机学院, 辽宁 沈阳 110136,北京理工大学 计算机学院, 北京 100081
基金项目:国家自然科学基金(61472069,61402089,U1401256,61732003,61729201);辽宁省自然基金(0170540702);中国博士后科学基金(2018M641706);中央高校基本科研业务费(N161602003)
摘    要:区块链技术是目前计算机领域的研究热点,其实现了去中心化,并且能够安全地存储数字信息,有效降低现实经济的信任成本.提出一种区块链存储容量可扩展模型的高效查询方法——ElasticQM.此查询模型由用户层、查询层、存储层和数据层这4个模块组成.在用户层,模型将查询结果缓存,加快再次查询相同数据时的查询速度;在查询层,模型采用容量可扩展区块链模型的全局查询优化算法,增加了查询超级节点、查询验证节点和查询叶子节点这3种节点角色,提高了查询效率;在存储层,模型改进了区块链的容量可扩展模型ElasticChain的数据存储过程,实现了存储的可扩展性,并减少了占用的存储空间;在数据层,提出一种基于B-M树的区块链存储结构,并给出了B-M树的建立算法和基于B-M树的查找算法,基于B-M树的存储结构,区块链会在进行块内局部查找时提高区块链的查询速度.最后,通过在多节点不同数据量的区块链中查询的实验结果表明,ElasticQM查询方法具有高效的查询效率.

关 键 词:区块链  查询算法  容量可扩展  B-M树  ElasticQM
收稿时间:2018-06-09
修稿时间:2018-08-28

Efficient Query Model for Storage Capacity Scalable Blockchain System
JIA Da-Yu,XIN Jun-Chang,WANG Zhi-Qiong,GUO Wei and WANG Guo-Ren. Efficient Query Model for Storage Capacity Scalable Blockchain System[J]. Journal of Software, 2019, 30(9): 2655-2670
Authors:JIA Da-Yu  XIN Jun-Chang  WANG Zhi-Qiong  GUO Wei  WANG Guo-Ren
Affiliation:School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China,School of Computer Science and Engineering, Northeastern University, Shenyang 110819, China;Liaoning Provincial Key Laboratory of Big Data Management and Analytics, Shenyang 110819, China,Sino-Dutch Biomedical and Information Engineering School, Northeastern University, Shenyang 110819, China,School of Computer, Shenyang Aerospace University, Shenyang 110136, China and School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China
Abstract:Blockchain technology is a research hotspot in the field of computers today. The decentralized and secured blockchain data effectively reduces the trust costs of the real economy. This study proposes an efficient query method for the scalable model of blockchain storage capacity-ElasticQM. The ElasticQM query model consists of four layers of modules:user layer, query layer, storage layer, and data layer. The user layer model puts the query results into the cache, which speeds up the query speed when querying the same data again. In the query level, this study proposes a global query optimization algorithm for the scalable blockchain model, which increases the roles of querying super nodes, query verification nodes and querying leaf nodes. It improves the efficiency of global queries. In the storage layer, the model improves the data storage process of the ElasticChain, which supports large scale blockchain. The storage layer achieves the scalability of the blockchain''s capacity and reduces the storage space. In the data layer, this study proposes a blockchain storage structure based on B-M tree, and gives the establishment algorithm of B-M tree and search algorithm based on B-M tree. Blockchains based on B-M trees will increase the speed of queries in local search within a block. The experimental results on real datasets show that the ElasticQM model has efficient query efficiency.
Keywords:blockchain  query algorithm  scalable capacity  B-M tree  ElasticQM
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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