Dictionary-Based File Encoding for Decode-Free Data Manipulation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data encoding methods require decoding and subsequent reencoding for manipulation, which is computationally expensive and inefficient.

Innovation Solution

A computer-implemented method that processes unencoded data files by mapping file segments to a dictionary file, generating encoded data files that can be manipulated without decoding, using homomorphic or heteromorphic encoding operations.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If data is encoded and then decoded for manipulation, then the data can be accessed and manipulated, but the computational cost and processing time increase significantly

Engineering Contradiction:
Improvedata manipulation capabilityVSAvoidprocessing time
Core Design Contradiction:
Ease of operationVSLoss of time

Solution Approach 1:

The patent performs encoding operations in advance to create an encoded data file with associated mapping information. This preliminary encoding allows subsequent manipulations to be performed directly on the encoded data without requiring full decoding, thus saving time while maintaining manipulation capability.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent introduces mapping information as an intermediary structure that bridges the encoded data and the original data representation. This mapping allows selective decoding or direct manipulation of specific portions of the data without requiring complete decoding, reducing processing time for partial operations.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Ease of operation

If data is encoded and then decoded for manipulation, then the data can be accessed and manipulated, but the computational resources required increase

Engineering Contradiction:
Improvedata manipulation capabilityVSAvoidcomputational energy
Core Design Contradiction:
Ease of operationVSUse of energy by moving object

Solution Approach 1:

The encoding and mapping generation is performed in advance when computational resources are available, transforming the data to an encoded form. Subsequent manipulations operate on this pre-encoded structure, avoiding the need to expend computational energy on repeated full decoding operations.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent divides the data into segments and creates mapping information that identifies specific portions. This segmentation allows manipulations to be performed on only the necessary segments in encoded form, rather than decoding and processing the entire data set, thus reducing computational energy consumption.

Inventive Principle:
Principle #1Segmentation

3Quantity of substance

If traditional encoding methods are used, then data can be stored efficiently, but manipulation requires full decoding and reencoding

Engineering Contradiction:
Improvestorage efficiencyVSAvoidprocessing complexity
Core Design Contradiction:
Quantity of substanceVSDevice complexity

Solution Approach 1:

The patent introduces mapping information as an intermediary that preserves the relationship between encoded data and original data structure. This mapping enables manipulation operations to be performed on encoded data without full decoding, maintaining storage efficiency while reducing processing complexity through selective access and operation on encoded portions.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS12169476B2Encoding / decoding system and method
Publication Date: 2024.12.17 LOGNOVATIONS HOLDINGS LLC
  • US12169476B2 patent drawing
  • US12169476B2 patent drawing
  • US12169476B2 patent drawing

AI summary

A computer-implemented method, computer program product and computing system for: receiving an unencoded data file; processing the unencoded data file to identify a plurality of file segments; mapping each of the plurality of file segments to a portion of a dictionary file, thus generating a plurality of mappings, wherein each of the plurality of mappings includes a starting location and a length; and generating a related encoded data file based, at least in part, upon the plurality of mappings.