Multidimensional Index Tree for Blockchain IoT Search
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain environments, such as Bitcoin, lack a reliable multi-condition search or range search function, resulting in low throughput and unreliable search results due to the absence of effective index management for transaction information.
Innovation Solution
Implementing a multidimensional index tree structure, specifically a K-D-B Tree, to index and verify transaction data, allowing for efficient multiple condition searches and ensuring data integrity through Merkle Root calculations and hash value verification.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a traditional blockchain search function is used, then the basic search capability is provided, but multi-condition search and range search functions are unavailable
Solution Approach 1:
The patent segments the search function by introducing a separate search module that operates independently from the core blockchain verification process. This search module uses a dedicated data structure (search index) to handle multi-condition and range searches, while the main blockchain remains unchanged for security and consensus functions.
Solution Approach 2:
The patent introduces a search index as an intermediary structure between the blockchain data and search queries. This index acts as a mediator that enables efficient multi-condition and range searches without modifying the underlying blockchain structure, allowing flexible search capabilities while maintaining blockchain integrity.
2Productivity
If no index structure is used for transaction data, then the blockchain structure remains simple, but search throughput is low and search results are unreliable
Solution Approach 1:
The patent segments the data access function by separating the blockchain verification process from the search process. The search index stores only the necessary search-related data (transaction information, block information) rather than the entire blockchain, enabling fast searches without requiring complex indexing of all blockchain data.
Solution Approach 2:
The patent implements preliminary action by pre-building a search index structure that organizes transaction data in advance. This index is constructed before search operations occur, allowing queries to be answered efficiently by traversing the pre-organized data structure rather than scanning the entire blockchain in real-time.
3Adaptability or versatility
If a search module is added to provide multi-condition search, then search versatility is improved, but the risk of false search results increases without verification
Solution Approach 1:
The patent implements feedback by having the search module verify search results against the blockchain consensus rules. The search index stores data that has already been verified by the blockchain, and the search results are cross-checked to ensure they conform to the blockchain's security and consistency requirements, preventing false results.
Solution Approach 2:
The patent uses the blockchain verification mechanism as an intermediary that guarantees the reliability of search results. The search index acts as a mediator between queries and the blockchain, ensuring that only data consistent with blockchain consensus is returned, thus maintaining trust without requiring direct user verification of each result.
Data Source
AI summary
The present disclosure relates to a search technology using a data structure for supporting multi-search in a blockchain-based IoT environment, and a method for providing a search function for blockchain includes receiving block data via a network, verifying transactions included in the received block data, and adding the block data as a node to an index tree of multidimensional index structures based on information about each transaction in the transaction verification.