Data storage and cutting method and device and storage medium

Abstract

The invention provides a data storage and cutting method and device and a storage medium. The method comprises the steps that father node information of all nodes except a root node of a first Merkeltree is stored in a local database; When the first leaf node is inserted into the first Merkel tree, storing a first index node corresponding to the first leaf node in a local database; Wherein the second key value of the first index node comprises the first key value of the first leaf node, the first block height and the first hash value; Wherein the second key value is used for searching a plurality of index nodes and corresponding leaf nodes which are the same as the first key value, and the father node information is used for searching redundant father nodes. According to the method, the index nodes corresponding to the leaf nodes are stored, redundant state data are deleted according to the index nodes, the data synchronization rate is greatly increased on the premise that the normalaccount state is not affected, and the read-write efficiency is improved.

Description

technical field [0001] The present application relates to the field of information technology, in particular to a data storage and clipping method, device and storage medium. Background technique [0002] In the data structure storage solution of the current blockchain system, Merkle Tree (MerkleTree), Merkle Balanced Binary Tree (MAVL), Merkle Patricia Tries (MPT) tree, etc. Account balance, etc.) are stored, and these trees are collectively referred to as state trees here. The main defect of the existing scheme is that because the Merkle tree mainly records the state data on the blockchain, the historical data of the state data is useless for most nodes except for the block rollback factor. The generation of historical data will continue to accumulate, and the number of nodes in the state tree will continue to increase. Due to the bottleneck of hard disk IO read and write, every time a node is inserted or data is read from a node, the read and write efficiency of the data...

AI Technical Summary

Problems solved by technology

The main defect of the existing scheme is that because the Merkle tree mainly records the state data on the blockchain, the historical data of the state data is useless for most nodes except for the block rollback factor. The generation of historical data will continue to accumulate, and the number of nodes in the state tree will continue to increase. Due to the bottleneck of hard disk IO read and write, every time a node is inserted or data is read from a node, the read and write efficiency of the database will be reduced; at the same time, redundancy The historical state data will also take up a lot of disk storage space

Images