Data Item Merging via Digital Value Sorting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing digital processing systems face challenges in effectively merging and sorting items from different data sources, particularly in compensation management applications, where items from various sources are difficult to navigate due to lack of appropriate sorting techniques that meet specific requirements.
Innovation Solution
Assigning digital values to items from different data sources based on their relation, allowing for sorting and grouping of items by type, using SQL queries to merge and sort action items in a compensation management system, ensuring that related items are grouped and ordered appropriately.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If items from different data sources are merged using traditional sorting techniques, then the merging process is straightforward, but the sorted output does not meet specific requirements for grouping related items
Solution Approach 1:
The patent introduces a digital value as an intermediary element between the item's original attributes and the sorting mechanism. This digital value serves as a mediator that encodes the relationship information, allowing the sorting algorithm to group related items without requiring complex relationship analysis during the sorting process itself.
Solution Approach 2:
The patent transforms the sorting problem by changing the parameter used for sorting from direct item attributes to derived digital values. These digital values are computed based on the relationships between items, effectively changing the sorting parameter to one that inherently captures the desired grouping behavior.
2Adaptability or versatility
If digital values are assigned to group related items, then items can be properly grouped by relationship, but the processing complexity increases
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing digital values that represent relationship information before the actual sorting operation. This allows the sorting process itself to remain simple while the grouping capability is achieved through the pre-prepared digital values that encode relationship metadata.
3Ease of operation
If traditional sorting is used without relationship-based grouping, then processing is simpler, but navigation of items becomes difficult
Solution Approach 1:
The patent changes the sorting parameter from simple attribute-based values to relationship-encoded digital values, which enables better navigation by grouping related items together while maintaining sorting efficiency through the use of standard sorting algorithms on the transformed parameter.
Data Source
AI summary
A digital processing system provided according to an aspect of the present invention processes items received from different data sources, specifically when a second set of items received from a second data source is related to corresponding ones of a first set of items received from a first data source. In one embodiment, each of the items in the first set and the second set is first assigned a corresponding digital value and then sorted according to a sort order of the assigned digital values to form a sorted output. The digital values are assigned such that items in the second set are grouped with related corresponding ones of the first set of items. Thus, items from different sources are merged (and sorted) based on the relation between the items.