Blockchain Data Storage Using Tree Nodes and Conflict Structures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data storage methods in blockchain technology face inefficiencies in storage space usage and retrieval performance due to the use of longer key lengths, and they lack effective mechanisms to handle data conflicts in a decentralized and transparent manner.
Innovation Solution
A data storage method utilizing a blockchain node that organizes data in a tree data structure, where a short key is generated by selecting a portion of the initial key, and when conflicts arise, an updated key-value pair is stored in a conflict data storage structure, ensuring efficient storage and retrieval by using a hash value based on the data and existing values.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If longer key lengths are used in blockchain data storage, then data integrity and security are improved, but storage space efficiency and retrieval performance deteriorate
Solution Approach 1:
The patent extracts only the necessary portion of the key (first key) from the original key (second key) to create a shortened key for storage in the tree data structure. This extraction principle reduces storage space while maintaining the ability to uniquely identify and retrieve data, resolving the contradiction between key length and storage efficiency.
Solution Approach 2:
The patent segments the key into two parts: a first key (shorter) used for storage in the tree data structure, and a second key (original) retained for verification purposes. This segmentation allows the system to use shorter keys for frequent storage operations while preserving the full key for integrity verification, thus improving storage efficiency without compromising data integrity.
2Reliability
If longer key lengths are used in blockchain data storage, then data security is maintained, but retrieval performance deteriorates
Solution Approach 1:
The patent extracts a shortened first key from the original second key for use in the tree data structure. This extracted key is sufficient for rapid retrieval operations, significantly improving retrieval performance while the original second key is preserved for security verification when needed.
Solution Approach 2:
The key segmentation into first key (for retrieval) and second key (for verification) enables the system to use shorter keys during frequent retrieval operations, improving speed, while maintaining security through the original key when verification is required.
3Device complexity
If traditional data storage methods are used without conflict handling mechanisms, then storage simplicity is maintained, but data conflict management capability is lost
Solution Approach 1:
The patent establishes a conflict data storage structure in advance (preliminary action) to handle potential data conflicts before they occur. This structure includes mechanisms for detecting conflicts between different key-value pairs and storing them appropriately, enabling the system to manage data conflicts efficiently without complicating the normal storage flow.
Solution Approach 2:
The conflict data storage structure acts as an intermediary between the tree data structure and potential data conflicts. When conflicts are detected, this intermediary structure handles the conflict resolution, allowing the main storage mechanism to remain simple while gaining robust conflict management capability.
Data Source
AI summary
A computer-implemented method for storing blockchain data includes: obtaining, by a blockchain node, a first key-value pair corresponding to data to be stored, in which the first key-value pair includes a value of the data to be stored and a first key of the data to be stored; identifying, based on the first key, a corresponding leaf node in a tree data organization structure; and modifying, by the blockchain node, the first key, to update the first key-value pair to obtain an updated key-value pair including the value of the data to be stored and the modified first key, and storing the updated key-value pair into a conflict data storage structure corresponding to the identified leaf node.