Method and system for optimizing classification data retrieval efficiency in block chain and application
A technology for classifying data and optimizing methods, applied in the field of blockchain, it can solve the problems of restricting the application of blockchain, poor performance of the blockchain system, not considering the support of data index structure, etc., to ensure security and improve retrieval efficiency. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0075] In many scenarios, data can usually be divided into three types: energy flow, data flow and business flow. Therefore, when storing data on the blockchain, the data is classified and stored, and only the required categories are retrieved when retrieving; and in order to improve For the retrieval speed of each category of data, a Merkle B+ tree index structure is maintained in each block, and this index structure can also better support range queries.
[0076] In the blockchain, data is retrieved through the hash value of the data. In order to retrieve data through specific keywords, the semantic information of each piece of data is extracted as the retrieval keyword before the data is uploaded to the chain. Therefore, the technical solution of the present invention includes two parts: data storage and data retrieval, which will be introduced separately below.
[0077] The data storage process proposed in the present invention is as follows:
[0078] Step 1: Extract sema...
Embodiment 2
[0090]Example 2: Process of data storage
[0091] The blockchain platform selects Ethereum to realize the power resource trading system. All power purchase transactions of users will be recorded in Ethereum, and the transaction data is jointly maintained by all users. User Alice purchases 50 kilowatt-hours of electricity in this system, and the system stores this transaction in the blockchain in the form of business flow.
[0092] The following is the process of transaction storage:
[0093] Step 1: The system extracts the keyword "Alice buys electricity 50" for this transaction;
[0094] Step 2: "Alice buys electricity 50" will be identified as a business flow, ready to be inserted into the BS subtree of the new block.
[0095] Step 3: If there is no node in the subtree or the root node of the subtree is not full, then directly insert the node containing the information of "Alice buys electricity 50" as the root node; otherwise, compare "Alice buys electricity 50" from the ...
Embodiment 3
[0099] Example 3: Flow of Data Retrieval
[0100] Alice has a need to query her electricity purchase history, and will use the keyword "Alice purchased electricity 50" to query this transaction in the system.
[0101] The following is the process of Alice querying transactions:
[0102] Step 1: The system recognizes that this information is a business flow.
[0103] Step 2: In the last block of the blockchain, enter the BS subtree of the index structure to search.
[0104] Step 3: Starting from the root node of the BS subtree, compare the node SI with "Alice buys electricity 50", if it is less than the minimum SI value of the node, continue to enter the left subtree for comparison, if it is greater than the maximum SI value of the node, Then continue to enter the right subtree for comparison, otherwise enter the middle subtree until the leaf node is compared.
[0105] Step 4: If the data in the leaf node is not the one queried, enter the previous block and repeat step 3 unt...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com