Indexed Compression Mapping for Arbitrary Data Reconstruction

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Conventional compression methods require decompression to start at the beginning of data or large intervals, limiting rapid random access to compressed data.

Innovation Solution

An index is created that correlates positions within the uncompressed data with corresponding positions in the compressed data, allowing decompression to begin at any point without decompressing prior data, enabling direct reconstruction of arbitrary portions.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If conventional compression methods are used, then data is compressed into fewer bits, but decompression must start at the beginning or large intervals, limiting random access

Engineering Contradiction:

Improvedata sizeVSAvoidrandom access capability

Core Design Contradiction:

Quantity of substanceVSEase of operation

Solution Approach 1:

The patent pre-calculates and stores decompression start positions and offset information during the compression phase. This preliminary action enables random access during decompression without requiring sequential processing from the beginning of the compressed data.

Inventive Principle:

Principle #10Preliminary action

Solution Approach 2:

The patent introduces an intermediary data structure (offset array or index) that maps compressed data positions to uncompressed data positions. This intermediary enables direct access to arbitrary portions of decompressed data without processing the entire compressed stream sequentially.

Inventive Principle:

Principle #24Intermediary (Mediator)

2Reliability

If decompression starts at the beginning of compressed data, then arbitrary portions can be reconstructed, but time and processing power are wasted on prior portions

Engineering Contradiction:

Improvedata reconstruction accuracyVSAvoiddecompression time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The compression algorithm pre-calculates and stores the decompression start position and offset information for arbitrary portions of the uncompressed data. This allows the decompression process to jump directly to the required portion without processing prior data, significantly reducing decompression time while maintaining reconstruction accuracy.

Inventive Principle:

Principle #10Preliminary action

3Quantity of substance

If compression removes redundancy to reduce data size, then storage and communication efficiency improve, but decompression flexibility is reduced

Engineering Contradiction:

Improvedata sizeVSAvoiddecompression flexibility

Core Design Contradiction:

Quantity of substanceVSAdaptability or versatility

Solution Approach 1:

During compression, the algorithm pre-calculates and embeds offset information and decompression start positions within the compressed data structure. This preliminary action preserves decompression flexibility by enabling random access to any portion of the uncompressed data while maintaining the compressed size benefits of redundancy removal.

Inventive Principle:

Principle #10Preliminary action

Data Source

PatentUS11675768B2Compression/decompression using index correlating uncompressed/compressed content

Publication Date: 2023.06.13 MICROSOFT TECHNOLOGY LICENSING LLC

AI summary

Compression of data that permits direct reconstruction of arbitrary portions of the uncompressed data. Also, the direct reconstruction of arbitrary portions of the uncompressed data. Conventional compression is done such that decompression has to begin either at the very beginning of the data, or at particular intervals (e.g., at block boundaries—every 64 kilobytes) within the data. However, the principles described herein permit decompression to begin at any point within the compressed data, without having to decompress any prior portion of the file. Thus, the principles described herein permit random access of the compressed data. In accordance with the principles described herein, this is accomplished by using an index that correlates positions within the uncompressed data with positions within the compressed data.