Nested Heap Data Normalization for Multi-Source Components
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing systems lack efficient normalization and storage methods for components from multiple sources, leading to incomplete sorting and limited computational and memory efficiency, which prevents mutual beneficial usage of components across sources.
Innovation Solution
A nested-heap storage structure is employed, where inner heaps are sorted by component sources and weighted, and outer heaps contain references to inner heaps, allowing for dynamic adjustment of component values based on location-specific fees, enabling efficient normalization and storage of components across geographically-distributed regions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If components are segmented by source, then computational and memory efficiency is improved, but the ability to leverage components from multiple sources mutually beneficially is prevented
Solution Approach 1:
The patent divides the component storage into separate inner heaps for each source (e.g., inner heap 132 for first source, inner heap 134 for second source). This segmentation allows efficient management of components from individual sources while maintaining the ability to query across sources through the outer heap structure, thus resolving the contradiction between computational efficiency and cross-source versatility.
Solution Approach 2:
The patent implements a nested heap structure where inner heaps (containing components from individual sources) are contained within an outer heap (containing references to inner heaps). This nesting allows the system to maintain organized, source-specific component storage for efficiency while enabling unified access across all sources through the outer heap, simultaneously achieving computational efficiency and cross-source leveraging capability.
2Ease of operation
If raw numerical values are used for sorting, then sorting simplicity is maintained, but incomplete sorting representation results due to varying weights from different sources
Solution Approach 1:
The patent introduces normalized values as intermediaries between raw component values and the sorting mechanism. Each component is converted to a normalized value that accounts for source-specific weights and characteristics before being stored in the heap. This intermediary normalization layer preserves sorting simplicity while achieving accurate representation by translating diverse source values into a common comparable format.
Data Source
AI summary
A system includes a processor and a memory including instructions that are executable for causing the processor to perform operations. The operations include accessing a new component value and a set of inner heaps. Each inner heap of the set of inner heaps includes a sorted set of components originating from a plurality of component sources. The operations further include assigning the new component value to a first inner heap of the set of inner heaps. In response to assigning the new component value to the first inner heap, the operations include sorting the first inner heap to identify a maximum or minimum value of the first inner heap. In response to determining that the new component value changes the maximum or minimum value of the first inner heap, the operations include updating an outer heap to include a reference to the new component value of the first inner heap.