JSON Nested Range Mapping for Direct Array Element Access

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing JSON data processing methods are inefficient due to the hierarchical nature of JSON structures, leading to increased computational overhead and resource consumption, especially when dealing with deeply nested data, and lack flexibility in selective data extraction.

Innovation Solution

Implementing nested ranges to streamline data extraction, generate a relational structure, and enable targeted access to specific elements within JSON data, bypassing traditional path-based traversal.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If traditional top-down JSON parsing is used to traverse the entire path, then complete data extraction is achieved, but computational overhead and processing time increase significantly

Engineering Contradiction:
Improvedata extraction completenessVSAvoidprocessing time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The patent pre-calculates and stores the path information (array indices and object keys) from root to target element before actual data extraction. This preliminary path computation allows subsequent extractions to follow the pre-determined route without re-traversing the entire JSON structure, significantly reducing processing time while maintaining complete data extraction capability

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent segments the JSON traversal process into distinct components: path computation (separating array index extraction from object key extraction), and data extraction along the computed path. This segmentation allows each component to be optimized independently and enables selective execution based on whether path computation or data extraction is needed

Inventive Principle:
Principle #1Segmentation

2Ease of operation

If manual top-down traversal through each path is implemented, then all data elements can be accessed, but device complexity and coding requirements increase

Engineering Contradiction:
Improvedata accessibilityVSAvoidcoding complexity
Core Design Contradiction:
Ease of operationVSDevice complexity

Solution Approach 1:

The patent introduces an intermediary path computation function that acts as a mediator between the JSON structure and the data extraction process. This function automatically computes the traversal path by extracting array indices and object keys, eliminating the need for manual top-down traversal coding while maintaining full data accessibility through the computed path

Inventive Principle:
Principle #24Intermediary (Mediator)

3Reliability

If the entire JSON document is parsed, then all data elements are available, but resource consumption and computation overhead increase

Engineering Contradiction:
Improvedata availabilityVSAvoidcomputation overhead
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent extracts only the necessary path information (array indices and object keys) from the JSON structure without parsing the entire document. By extracting just the computational path to the target element, the system achieves reliable data availability while minimizing resource consumption and computation overhead by avoiding unnecessary parsing of unrelated data portions

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS20250384020A1System and method for JSON data processing
Publication Date: 2025.12.18 STATE FARM MUTAL AUTOMOBILE INSURANCE COMPANY
  • US20250384020A1 patent drawing
  • US20250384020A1 patent drawing
  • US20250384020A1 patent drawing

AI summary

Systems and methods for deriving array subscripts from nested ranges in a JSON structure are disclosed. The method may include, such as by one or more processors: (1) loading and parsing JSON data to convert a JSON string of the JSON data into a data structure, wherein the JSON data includes objects, arrays, and/or primitive values; (2) traversing the data structure to identify nested ranges within the objects, arrays, and/or primitive values; (3) storing start and end positions of the nested ranges; (4) extracting element ranges by dissecting the nested ranges, including array ranges, into individual array element ranges based upon position information; (5) mapping array indices to the corresponding individual array element ranges by correlating an element of the arrays to individual array element ranges; and/or (6) sending queries to a database, the queries include at least one of the array indices and the correlated at least one element.