Hierarchical Data Structure with Duplicate Nodes for Continuous Access
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data structures face performance issues due to unnecessary rebalancing operations and temporary pauses during rebalancing, which affect system performance, and Bloom Filters suffer from increasing false positives as data is added, impacting system efficiency.
Innovation Solution
A method and system that maintain a hierarchically arranged data structure with nodes having two or less branches, allowing data access during rebalancing by creating duplicates of nodes and updating the structure to balance it, while using a Bloom Filter with a Counting Bloom Filter to manage false positives.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If automatic tree balancing algorithm is applied to maintain balanced data structure, then the tree balance is improved, but unnecessary rebalancing operations occur and system performance deteriorates
Solution Approach 1:
The patent changes the balancing parameter from strict height difference (conventional) to weighted path length difference (novel). By using weights associated with each node and calculating weighted path lengths, the system achieves balance with fewer, more meaningful rebalancing operations, improving system performance while maintaining structural stability
Solution Approach 2:
The patent creates duplicate copies of nodes during the rebalancing process. When a node needs to be rebalanced, instead of immediately restructuring the entire tree, the system creates duplicate nodes and gradually transforms the structure, allowing continuous data access during rebalancing and reducing performance impact
2Stability of the object's composition
If rebalancing operations are performed to maintain data structure balance, then the tree balance is improved, but data access requests cannot be serviced during rebalancing
Solution Approach 1:
The patent performs preliminary actions by creating duplicate nodes before actual rebalancing occurs. These duplicate nodes are prepared in advance and can immediately serve data access requests, ensuring continuous service availability while the gradual transformation to the new balanced structure proceeds in the background
Solution Approach 2:
The patent implements dynamic rebalancing where the data structure transitions gradually from unbalanced to balanced state through multiple intermediate steps. During this dynamic transformation, duplicate nodes are created and activated to maintain data access capability, making the rebalancing process adaptive rather than static and interruptive
3Quantity of substance
If Bloom Filter is used to determine data existence in data structure, then space efficiency is improved, but false positives increase as more data is added
Solution Approach 1:
The patent introduces weighted path length calculations as an intermediary mechanism between the Bloom Filter and the final data existence determination. When the Bloom Filter indicates possible existence, the system uses weighted path length metrics to verify actual accessibility, filtering out false positives while maintaining space efficiency of the Bloom Filter structure
Solution Approach 2:
The patent implements feedback mechanisms where the results of weighted path length calculations are fed back to adjust Bloom Filter parameters and improve its accuracy. The system continuously monitors false positive rates and adjusts the Bloom Filter's hash function count and bit array size based on the actual data distribution and weighted path characteristics
Data Source
AI summary
System and method for searching a data structure are disclosed. The method includes providing a data structure that includes a plurality of data entries stored in an external random access memory (RAM) and a portion of the data structure is stored in an internal cache memory, performing one or more hash functions on each entry of the data structure to generate an encoding that maps to a location in the external RAM, maintaining a count of encodings that map to the location in the external RAM, receiving a search string, performing the one or more hash functions on the search string to generate an index to the count of encodings, and searching the data structure in accordance with the count of encodings stored in the internal cache memory and in the external RAM.