Data Sorting on Limited Resource Computers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods are inefficient for sorting large amounts of data on limited resource computers, leading to significant time and cost expenditures.
Innovation Solution
A data sorting method that determines data recording characteristics and calculates a sort-table size to efficiently sort data on a typical office computer, utilizing a data partition methodology that allows for quick sorting of large data sets on limited resource computers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional sorting methods are used on large data sets, then data can be sorted, but the computer requires excessive memory resources and time
Solution Approach 1:
The patent divides the large data set into multiple smaller data sets by partitioning based on sorting keys. This segmentation allows the computer to process smaller portions of data simultaneously, reducing the memory resources needed while maintaining efficient sorting speed through parallel processing of multiple data sets.
Solution Approach 2:
The patent introduces a new dimension of processing by creating multiple data sets with different sorting keys. Instead of sorting one large data set sequentially, the system creates parallel data sets that can be processed simultaneously, effectively adding a temporal and computational dimension to the sorting process.
2Productivity
If traditional sorting methods are used on large data sets, then data can be sorted, but the process takes excessive time
Solution Approach 1:
By segmenting the large data set into multiple smaller data sets based on different sorting keys, the patent enables parallel processing of these data sets. This segmentation significantly reduces sorting time because multiple data sets can be processed simultaneously rather than sequentially.
Solution Approach 2:
The patent performs preliminary actions by pre-calculating and creating multiple data sets with different sorting keys before the actual sorting process. This preliminary organization of data into multiple manageable sets enables faster processing and reduces the overall sorting time through parallel operations.
3Ease of operation
If the entire data set is loaded into memory for sorting, then sorting can be performed efficiently, but computers with limited RAM cannot handle large data sets
Solution Approach 1:
The patent segments the large data set into multiple smaller data sets that can individually fit into the computer's limited RAM. This segmentation allows efficient sorting operations to be performed on manageable data portions without requiring excessive memory capacity, making the system suitable for computers with limited RAM.
Solution Approach 2:
Instead of loading the entire data set into memory (excessive action), the patent loads only the necessary portions of data into memory at a time (partial action). This approach allows efficient sorting operations to be performed on manageable data portions while keeping memory usage within the capabilities of computers with limited RAM.
Data Source
AI summary
A method of sorting data on a limited resource computer is disclosed. Data recording characteristics associated with a data set are determined. A sort-table size is calculated based on the data recording characteristics, and the data set is sorted based on the sort-table size.