基于改进区块存储结构的高效数据检索模型

Efficient Data Retrieval Model Based on Improved Block Storage Structure

区块链技术具有去中心化和不可篡改性等特征,能安全有效的降低新任成本且安全的存储数据,是目前计算机领域研究的热点。然而,目前区块链系统难以满足大量数据下的查询访问需求,当前研究大多是从数据同步存储到外部数据库中,通过外部数据库进行查询,增加了大量的通信量,没有解决区块链本身的问题。本文根据B+树这种结构的查询稳定性和查询路径短的优点,提出了一种解决方案,通过改进区块的存储结构,利用B+树和默克尔树各自优势,改进了默克尔树,在保证区块链验证效率的情况下增加区块链的查询性能,并且支持范围查询,减少了通信量。然后设计了基于改进区块结构的构建算法和查找算法;最后通过实验验证了所改进结构的可行性和有效性。

Blockchain technology has the characteristics of decentralization and unforgeability, which can effectively reduce the new cost and store data safely, which is a research hotspot in the computer field. However, the current blockchain system is difficult to meet the demand of query and access under a large amount of data. Most of the current research is from synchronous storage of data to external database, query through external database, which increases a lot of traffic, and does not solve the problem of blockchain itself. In this paper, according to the advantages of B+ tree such as query stability and short query path, a solution is proposed. By improving the storage structure of blocks, taking advantage of the respective advantages of B+ tree and Merkel tree, the Merkel tree is improved. The query performance of block chain is increased under the condition of ensuring the verification efficiency of blockchain, and the range query is supported, and the traffic is reduced. Then the construction algorithm and search algorithm based on the improved block structure are designed;finally, the feasibility and effectiveness of the improved structure are verified by experiments.