Hybrid Bifurcation of Intersection Nodes in Multidimensional Data Structures

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Processing intersection queries in multidimensional data structures can be inefficient due to varying complexity and size, leading to high latency and memory usage, especially when dealing with large and complex financial data sets in enterprise software systems.

Innovation Solution

A method is introduced to bifurcate the processing of intersection queries between two algorithms, one that processes each node individually and another that uses pre-cached modifier mappings to process nodes in parallel, allowing for optimized memory usage and computation time based on the data structure's complexity and query composition.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If intersection queries are processed individually, then processing flexibility is maintained, but processing time and latency increase

Engineering Contradiction:

Improveprocessing timeVSAvoidprocessing complexity

Core Design Contradiction:

Loss of timeVSDevice complexity

Solution Approach 1:

The patent segments the processing of intersection queries into two distinct paths: individual query processing and batch processing with pre-computed modifier mappings. This segmentation allows the system to choose the appropriate processing mode based on query characteristics, thereby reducing overall processing time while managing complexity through structured division of work

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The patent applies preliminary action by pre-computing and caching modifier mappings for batches of intersection queries. Instead of computing modifiers for each query individually at runtime, the system performs this computation in advance and stores the results, significantly reducing processing time for subsequent queries that can utilize these pre-computed mappings

Inventive Principle:

Principle #10Preliminary action

2Productivity

If pre-cached modifier mappings are used to process queries together, then processing speed increases, but memory usage increases

Engineering Contradiction:

Improveprocessing speedVSAvoidmemory usage

Core Design Contradiction:

ProductivityVSQuantity of substance

Solution Approach 1:

The system performs preliminary computation of modifier mappings and caches them in memory. This allows batched queries to be processed rapidly by retrieving pre-computed mappings rather than computing them in real-time, thereby increasing processing speed while accepting increased memory usage as a trade-off

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent changes the state of modifier mappings from being dynamically computed to being pre-computed and cached. This parameter change in the processing approach allows the system to trade memory resources for processing speed, as the pre-computed mappings are stored in memory for rapid access during query processing

Inventive Principle:

Principle #35Parameter changes

3Quantity of substance

If individual node processing is used, then memory usage is optimized, but processing latency increases

Engineering Contradiction:

Improvememory usageVSAvoidprocessing latency

Core Design Contradiction:

Quantity of substanceVSLoss of time

Solution Approach 1:

The patent segments query processing into individual and batch modes, allowing the system to optimize for memory usage when processing individually while maintaining the option to use batch processing with pre-computed mappings when latency is the primary concern

Inventive Principle:

Principle #1Segmentation

Solution Approach 2:

The system dynamically selects between individual processing and batch processing with pre-cached mappings based on query characteristics and system state. This dynamic approach allows optimization of memory usage for simple queries while reducing latency for complex or batched queries, adapting to different operational requirements

Inventive Principle:

Principle #15Dynamics

4Adaptability or versatility

If complex multidimensional data structures are queried, then data retrieval capability is enhanced, but processing time varies and increases

Engineering Contradiction:

Improvedata retrieval capabilityVSAvoidprocessing time

Core Design Contradiction:

Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-computing modifier mappings that capture the complex relationships in multidimensional data structures. This allows the system to handle complex data retrieval queries more efficiently by leveraging pre-computed mappings rather than performing complex computations for each query

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The pre-computed modifier mappings serve as an intermediary structure that simplifies complex multidimensional data relationships. Instead of directly querying complex multidimensional structures, the system uses these intermediary mappings to facilitate faster data retrieval while maintaining the capability to handle complex queries

Inventive Principle:

Principle #24Intermediary (Mediator)

Data Source

PatentUS9323812B2Hybrid bifurcation of intersection nodes

Publication Date: 2016.04.26 ORACLE INT CORP

AI summary

A method of processing a set of intersection queries in a multi-dimensional data structure may include receiving the set of intersection queries for the multi-dimensional data structure. The method may also include determining whether to process each of the set the intersection queries individually, or whether to process the set of intersection queries together using pre-cached modifier mappings. The method may additionally include processing the set of intersection queries, and providing intersection values that correspond to the set of intersection queries.