Aging Data Compression in Dispersed Storage Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional systems face inefficiencies in storage space utilization and performance latency when compressing data objects in a Dispersed Storage Network (DSN), as compression at ingestion time can cause latency and inefficient use of storage space, especially for long-lived data objects.

Innovation Solution

A method and system that compress aging data within a DSN during the compaction process, identifying objects that have survived multiple compactions and rewriting them to a new area, thereby removing gaps and optimizing storage space without impacting client performance.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data objects are compressed at ingestion time, then storage space utilization is improved, but system performance latency increases

Engineering Contradiction:
Improvestorage space utilizationVSAvoidperformance latency
Core Design Contradiction:
Quantity of substanceVSLoss of time

Solution Approach 1:

The system performs compression action in advance during the compaction process rather than at ingestion time. By identifying aged data objects (those that have survived multiple compaction cycles) and compressing them during compaction, the system prepares storage space efficiently without adding latency to the initial data ingestion operation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The compression strategy is made dynamic by applying compression only to aged data objects that have survived a predetermined number of compaction cycles. This dynamic approach allows the system to adapt compression behavior based on data age and compaction history, rather than applying compression uniformly to all data objects at fixed ingestion time.

Inventive Principle:
Principle #15Dynamics

2Quantity of substance

If all data objects are compressed during compaction, then storage space utilization is improved, but processing time increases

Engineering Contradiction:
Improvestorage space utilizationVSAvoidcompaction processing speed
Core Design Contradiction:
Quantity of substanceVSProductivity

Solution Approach 1:

The system applies different compression treatment to different data objects based on their age. Aged data objects (those exceeding a predetermined compaction threshold) are compressed, while newer data objects are not compressed during compaction. This local differentiation optimizes both storage efficiency and processing speed by applying compression only where necessary.

Inventive Principle:
Principle #3Local quality

Solution Approach 2:

Instead of compressing all data objects during compaction (excessive action), the system applies compression only to aged data objects that meet specific criteria (partial action). This partial approach reduces unnecessary processing time while still achieving significant storage space utilization improvement through compression of the most space-efficient candidates.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS11372547B2Compression of aging data during compaction
Publication Date: 2022.06.28 INTERNATIONAL BUSINESS MACHINE CORPORATION
  • US11372547B2 patent drawing
  • US11372547B2 patent drawing
  • US11372547B2 patent drawing

AI summary

Methods and systems for compression of aging data during compaction are disclosed. A method includes: ingesting a plurality of data objects into a dispersed storage network (DSN); determining that a compaction threshold is met for a storage medium in the DSN; and compacting the storage medium, the compaction including, for each of the plurality of data objects: determining a number of times the data object has been compacted; in response to the number of times the data object has been compacted exceeding a predetermined threshold, compressing the data object and rewriting the compressed data object to a new area on a storage medium; and in response to the number of times the data object has been compacted not exceeding the predetermined threshold, rewriting the data object to the new area on the storage medium without compressing the data object.