Compressed Data Search via Pattern Inversion

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Current computer systems face significant search time challenges when looking for patterns in compressed data, as they need to decompress data in volatile memory before searching, which is inefficient and time-consuming.

Innovation Solution

A non-volatile storage unit with a local controller and compression engine that allows for rapid search through compressed data without decompression, using reproducible compression algorithms and internal search engines to compare compressed data directly, enabling parallel processing and efficient search results transmission.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If compressed data is copied to volatile memory and decompressed before searching, then the search can be performed on uncompressed data, but the search time becomes sizeable and inefficient

Engineering Contradiction:

Improvesearch accuracyVSAvoidsearch time

Core Design Contradiction:

Measurement precisionVSLoss of time

Solution Approach 1:

Instead of decompressing data to search for patterns, the patent inverts the approach by compressing the search pattern itself and then comparing it against compressed data blocks stored in the database. This allows direct searching of compressed data without decomposition, dramatically reducing search time while maintaining accuracy

Inventive Principle:

Principle #13The other way round (Inversion)

Solution Approach 2:

The patent pre-compresses search patterns before they are used for querying the database. This preliminary compression action enables the search engine to work directly with compressed data blocks, avoiding the time-consuming decompression step that would otherwise be required for each search operation

Inventive Principle:

Principle #10Preliminary action

2Volume of stationary object

If data is compressed for storage, then storage space is reduced, but search operations require decompression which increases processing time

Engineering Contradiction:

Improvestorage capacityVSAvoidsearch throughput

Core Design Contradiction:

Volume of stationary objectVSProductivity

Solution Approach 1:

The patent inverts the traditional search approach by compressing query patterns and comparing them against compressed database blocks. This allows the system to maintain compressed storage while achieving fast search operations, as both the stored data and search queries operate in compressed form

Inventive Principle:

Principle #13The other way round (Inversion)

Solution Approach 2:

The patent changes the parameter of data representation by maintaining compressed form throughout the search process rather than converting to uncompressed form. Search patterns are compressed using the same compression algorithm as the database, allowing direct comparison in compressed space and eliminating the decompression step

Inventive Principle:

Principle #35Parameter changes

3Reliability

If iterative decompression and search is performed on compressed data, then complete data search is achieved, but the process is repeated multiple times increasing overall processing time

Engineering Contradiction:

Improvesearch completenessVSAvoidprocessing duration

Core Design Contradiction:

ReliabilityVSDuration of action of moving object

Solution Approach 1:

The patent inverts the iterative decompression approach by performing a single compression of the search pattern and then comparing it against all compressed database blocks in one pass. This eliminates the need for repeated decompression and re-compression cycles while maintaining complete search coverage

Inventive Principle:

Principle #13The other way round (Inversion)

Solution Approach 2:

The patent creates a compressed copy of the search pattern that can be efficiently compared against compressed database blocks. This compressed pattern copy enables single-pass searching through the entire database without requiring multiple iterative decompression cycles

Inventive Principle:

Principle #26Copying

Data Source

PatentUS10140033B2Apparatus, system, and method for searching compressed data

Publication Date: 2018.11.27 EXECUTIVE ADVISORY FIRM LLC

AI summary

A system, method and apparatus to provide searching capabilities of a given queue to all of requested search patterns in a non-volatile storage unit with compressed data without decompression thereof. In one embodiment the invention provides system, method and apparatus to execute one or more queued search request of one or more search pattern for one or more non-volatile storage units without decompression of non-volatile storage units compressed data in sequence or in parallel, in order or out of order from the queue. In another embodiment the system, method, and apparatus utilizes a software storage device driver scheduler to distribute the search queues to one or more non-volatile storage units in series or in parallel, in order or out of order, in standard or virtualized operating system capable environments.