Ordered Record Selection Decomposition for High-Speed Data Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing techniques for processing big data, such as those involving sensor and observation devices, face challenges in efficiently decomposing tabular data into components for high-speed operations like search, sort, and aggregation, particularly in achieving fast decomposition of ordered record selection components into record selection and order components.
Innovation Solution
A calculation device and method that decompose an ordered record selection component into a record selection component and a record order component using a processor, allowing for high-speed processing by employing a natural number index mechanism, where the ordered record selection component is represented as a product of the record selection and record order components, enabling efficient operations like search, sort, and aggregation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If tabular data is decomposed into component groups including natural numbers to achieve high-speed operations, then processing speed for search, sort, and aggregation operations is improved, but the complexity of data decomposition and component manipulation increases
Solution Approach 1:
The patent segments the ordered record selection component into two distinct components: a record selection component containing record numbers and a record order component containing permutation information. This segmentation allows each component to be processed independently, enabling high-speed operations through parallel processing while maintaining manageable complexity through clear functional separation.
Solution Approach 2:
The patent introduces a decomposition unit as an intermediary component that transforms the ordered record selection component into the two separate components. This intermediary structure simplifies the overall system by providing a dedicated transformation layer that handles the complexity of decomposition centrally, allowing the main processing logic to operate on the simplified components.
2Productivity
If ordered record selection components are decomposed into record selection and order components, then operations like search and sort can be performed at high speed, but the time required for decomposition itself increases
Solution Approach 1:
The patent implements preliminary action by pre-computing and storing the decomposition results in data structures that enable O(1) access during actual operations. The decomposition unit prepares the record selection and order components in advance, so that when search, sort, or aggregation operations are needed, the components are already ready for immediate processing without time-consuming decomposition at runtime.
3Ease of operation
If natural number index mechanism is used to represent ordered sets, then various operations can be achieved through simple arithmetic operations, but the difficulty of implementing and maintaining the index structure increases
Solution Approach 1:
The patent segments the natural number index mechanism into two independent parts: the record selection component that handles which records are selected and the record order component that handles the permutation ordering. This segmentation allows each part to use simple natural number arithmetic independently, achieving ease of operation while reducing the complexity of maintaining the overall index structure through modular design.
Data Source
AI summary
A calculation device includes a processor; and a memory storing program instructions that cause the processor to decompose an ordered record selection component S(n)(N) into a record selection component L(n)(N) and a record order component P(n)(n). The ordered record selection component S(n)(N) is an ordered set including n (0≤n≤N) elements selected from a record number set including integers from Q to Q+N−1 (Q is a predetermined integer and N is a predetermined integer greater than or equal to 1). The record selection component L(n)(N) is a set including n elements selected from the record number set. The record order component P(n)(n) represents an order of the elements of the record selection component L(n)(N). The processor decomposes the ordered record selection component S(n)(N) by using a predetermined operation between the record selection component L(n)(N) and the record order component P(n)(n).