Solid State Cache Index for Deduplicated Storage

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Deduplicated storage systems face inefficiencies in locating data during backup and recovery operations due to the need to scan entire volumes for duplicate data segments, which wastes resources and reduces system performance.

Innovation Solution

A deduplicated storage system maintains an index using a hash table on a solid-state drive (SSD) that stores fingerprint/container associations, allowing for quick identification and retrieval of data segments by hashing fingerprints to identify corresponding hash buckets and storing container identifiers, with mechanisms for merging and scaling the index to optimize resource use.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Loss of time

If the deduplicated storage system scans entire volumes to locate data, then data can be found, but the time required increases significantly and system resources are wasted

Engineering Contradiction:
Improvedata location timeVSAvoidsystem performance
Core Design Contradiction:
Loss of timeVSProductivity

Solution Approach 1:

The system creates a hash index of all data segments before actual backup or recovery operations. This preliminary indexing allows the system to quickly locate data segments by their hash values during subsequent operations, eliminating the need to scan entire volumes and significantly reducing data location time while improving overall system performance

Inventive Principle:
Principle #10Preliminary action

2Speed

If the system stores fingerprint/container associations in an index, then data location speed improves, but the device complexity increases

Engineering Contradiction:
Improvedata location speedVSAvoidindex maintenance complexity
Core Design Contradiction:
SpeedVSDevice complexity

Solution Approach 1:

The system extracts only the necessary information (fingerprint and container association) and stores it in a hash index structure. By taking out only the essential data elements needed for quick lookup and eliminating unnecessary details, the system achieves fast data location while keeping the index structure relatively simple and manageable

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The system creates a copy of the data organization structure in the form of a hash index that mirrors the actual storage layout. This copying approach allows the system to query data location information without physically scanning the entire storage volume, improving speed while maintaining a manageable index structure that reflects the actual data organization

Inventive Principle:
Principle #26Copying

3Reliability

If the system writes data segments multiple times to ensure availability, then data reliability improves, but storage resources are wasted

Engineering Contradiction:
Improvedata availabilityVSAvoidstorage space consumption
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The system performs deduplication analysis before writing data segments to storage. By checking the hash index beforehand to determine whether a data segment already exists, the system can skip writing duplicate segments and only write new unique data, ensuring data availability through proper deduplication while avoiding waste of storage resources on redundant copies

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11113237B1Solid state cache index for a deduplicate storage system
Publication Date: 2021.09.07 EMC IP HLDG CO LLC
  • US11113237B1 patent drawing
  • US11113237B1 patent drawing
  • US11113237B1 patent drawing

AI summary

A method, article of manufacture, and apparatus for creating a fingerprint to container id index is discussed. The index may be stored in-memory, on disk, and on a solid-state device. The index may be used to quickly locate a container identifier given a data segment fingerprint.