A data storage and cutting method, device and storage medium

Abstract

The present invention provides a data storage and clipping method, device and storage medium. The method includes: storing the parent node information of each node of the first Merkle tree except the root node in a local database; When inserting the first leaf node in the Merkle tree, store the first index node corresponding to the first leaf node in the local database; wherein, the second key value of the first index node includes 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 to find several index nodes and corresponding leaf nodes that are the same as the first key value, and the parent node information is used to find redundant parent nodes. The present invention stores the index nodes corresponding to the leaf nodes, deletes redundant state data according to the index nodes, and greatly improves the speed of data synchronization and read-write efficiency without affecting the normal account state.

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