Storage Garbage Collection Using Expiration-Time Grouping

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data storage systems face inefficiencies in garbage collection due to randomly distributed expiration times of recovered data, leading to prolonged migration times and reduced efficiency.

Innovation Solution

A method that centralizes the expiration times of valid data by storing recovered data in a target storage area where the time difference between the earliest and latest expiration times is within a preset limit, allowing for efficient garbage collection by minimizing the amount of data to be migrated.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If recovered data is randomly stored in storage areas, then data can be stored flexibly, but garbage collection time increases and efficiency decreases

Engineering Contradiction:
Improvedata storage flexibilityVSAvoidgarbage collection time
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The patent applies preliminary action by pre-organizing recovered data according to expiration time before garbage collection occurs. When data is recovered, it is immediately sorted and stored in storage areas based on expiration time characteristics, so that when garbage collection is needed, the data is already in an optimized state requiring minimal migration.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If valid data is migrated before garbage collection, then garbage collection can be performed, but the migration process takes a long time

Engineering Contradiction:
Improvegarbage collection completionVSAvoidmigration time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary organization of data by expiration time continuously in the background, so when garbage collection is triggered, the migration requirement is minimized. This preliminary preparation ensures that garbage collection can complete reliably while reducing the actual migration time required at collection moment.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent changes the parameter organization of stored data from random positioning to expiration-time-based positioning. By organizing data according to expiration time parameters, the system enables more efficient garbage collection operations without requiring extensive data migration.

Inventive Principle:
Principle #35Parameter changes

3Ease of operation

If data is stored with different expiration times in storage areas, then data can be stored independently, but garbage collection efficiency is reduced

Engineering Contradiction:
Improveindependent data storageVSAvoidgarbage collection efficiency
Core Design Contradiction:
Ease of operationVSProductivity

Solution Approach 1:

The patent changes how data is organized in storage areas by sorting according to expiration time parameters. This parameter-based organization allows the system to identify and collect garbage more efficiently while still maintaining independent storage capabilities for different data types.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The system segments storage areas based on expiration time characteristics, creating organized groups of data with similar expiration profiles. This segmentation enables more efficient garbage collection operations by allowing targeted collection of expired data groups without affecting other data.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS12008263B2Garbage collection and data storage method and apparatus, and storage system
Publication Date: 2024.06.11 HUAWEI TECH CO LTD
  • US12008263B2 patent drawing
  • US12008263B2 patent drawing
  • US12008263B2 patent drawing

AI summary

A data storage method and apparatus, and a storage system are provided. The method is applied to a storage system. The storage system includes at least one first memory and a second memory. The at least one first memory includes a plurality of storage areas. Garbage collection is performed based on each of the plurality of storage areas. In the method, a time length between the earliest expiration time and the latest expiration time in expiration time of valid data stored in a target storage area is limited to be less than or equal to a preset time length, so that the expiration time of the valid data stored in the target storage area is comparatively centralized.