Grid Encoded Data Storage for Efficient Repair

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Modern network computing and data storage systems face challenges in balancing data availability and integrity, particularly in distributed environments, where existing error correction and redundancy schemes can lead to degraded performance and customer experience due to delays in data retrieval.

Innovation Solution

The implementation of grid encoded data storage systems that use shard-based encoding techniques, including parity encoding and redundancy codes like Reed-Solomon codes, to distribute data across multiple storage devices and datacenters, ensuring data durability and availability while minimizing additional storage volume requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If error correcting and error tolerance schemes are used to ensure data integrity, then data reliability is improved, but data availability deteriorates due to delays in retrieving data from the data archive

Engineering Contradiction:
Improvedata integrityVSAvoiddata retrieval delay
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent segments data into multiple shards distributed across different storage devices and datacenters. Each shard is independently accessible, allowing parallel retrieval operations. This segmentation enables the system to retrieve data from multiple locations simultaneously, reducing overall retrieval time while maintaining data integrity through distributed redundancy.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent performs preliminary encoding of data into multiple shards with embedded redundancy information before storage. This preliminary action creates self-contained data units that can be independently reconstructed, eliminating the need for complex real-time error correction during retrieval and thus reducing data access delays.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If redundancy schemes are implemented to ensure data durability, then data reliability is improved, but storage volume requirements increase

Engineering Contradiction:
Improvedata durabilityVSAvoidstorage volume
Core Design Contradiction:
ReliabilityVSVolume of stationary object

Solution Approach 1:

The patent employs advanced erasure coding schemes (such as Reed-Solomon codes) that change the redundancy parameter efficiency. Instead of traditional replication that stores identical copies, the system uses mathematical encoding to create redundant shards where k out of n shards can reconstruct the original data. This parameter optimization achieves high durability with reduced storage overhead compared to simple replication.

Inventive Principle:
Principle #35Parameter changes

Solution Approach 2:

The patent creates encoded copies of data in the form of redundant shards distributed across multiple locations. Rather than storing full duplicates, the system stores mathematically derived copies that collectively enable data reconstruction, achieving durability through distributed copying with optimized storage efficiency.

Inventive Principle:
Principle #26Copying

Data Source

PatentUS10162704B1Grid encoded data storage systems for efficient data repair
Publication Date: 2018.12.25 AMAZON TECH INC
  • US10162704B1 patent drawing
  • US10162704B1 patent drawing
  • US10162704B1 patent drawing

AI summary

Techniques for encoding data storage systems using grid encoded data storage systems are described herein. Data to be stored in a data storage system is obtained and the data is stored in a grid of shards using grid encoding techniques that store the data in a combination of data shards and derived shards. Each of the shards has at least a first index corresponding to one dimension of the grid and a second index corresponding to a second dimension of the grid. Loss of a plurality of data shards can be repaired because each shard is reproducible from one or more shards with a first index that is associated with the first index of the shard and is also reproducible from one or more shards with a second index that is associated with the second index of the shard.