Encoded Data Slice Updates Using Delta Parity in Dispersed Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current dispersed storage networks face challenges in efficiently updating and managing error-encoded data across multiple storage units without requiring redundant copies, which can lead to data loss and security vulnerabilities.
Innovation Solution
The implementation of a dispersed storage network with a managing unit and integrity processing unit that uses Cauchy Reed-Solomon error encoding and decoding, allowing for efficient data updates and error correction by generating and storing encoded data slices across multiple storage units, enabling secure and resilient data storage without redundant copies.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If redundant data copies are stored for error correction, then data reliability is improved, but storage space efficiency deteriorates
Solution Approach 1:
The patent segments data into multiple dispersed slices distributed across different storage units. Instead of storing complete redundant copies, the data is divided and spread out, allowing efficient updates by modifying only specific slices rather than entire data copies.
Solution Approach 2:
The patent employs Cauchy Reed-Solomon error encoding which transforms data into encoded slices with specific mathematical properties. This encoding scheme allows the system to achieve reliable data recovery and updates by changing the mathematical parameters of the encoding rather than storing physical redundancies.
2Quantity of substance
If data is dispersed across multiple storage units without replication, then storage efficiency is improved, but complexity of error correction deteriorates
Solution Approach 1:
The patent uses Cauchy Reed-Solomon encoding which provides a mathematical framework for error correction. The encoding transforms data into slices with specific algebraic properties, making error correction achievable through systematic mathematical operations rather than complex procedural methods.
Solution Approach 2:
The encoded slices contain embedded redundancy information within their mathematical structure. When updating or recovering data, the system uses the inherent properties of the Cauchy Reed-Solomon codes to automatically perform error correction without requiring external complex correction mechanisms.
3Reliability
If traditional replication methods are used for data updates, then data availability is improved, but update efficiency deteriorates
Solution Approach 1:
The patent segments data into discrete slices that can be independently updated. When data needs to be updated, only the affected slices are modified and re-encoded, rather than updating entire replicated data copies. This segmentation enables efficient partial updates while maintaining data availability through the dispersed storage structure.
Solution Approach 2:
The system performs preliminary error encoding of data slices before storage. This pre-encoding establishes the mathematical relationships between slices, enabling efficient updates by allowing the system to regenerate missing or updated slices through systematic computation rather than requiring complete data re-synchronization across all storage units.
Data Source
AI summary
A distributed storage (DS) processing unit distributes an initial set of encoded data slices and an initial parity slice, for storage in multiple DS units. The initial parity slice is associated with an initial encoded data slice stored in a first DS unit. The DS processing unit transmits an updated encoded data slice reflecting changes to the initial encoded data slice, and obtains, from the first DS unit, delta parity information associated with a delta parity slice. The delta parity slice reflects differences between parity values calculated using the updated data slice and the initial data slice. An updated parity slice is generated by performing an exclusive OR (XOR) operation on the initial parity slice and the delta parity slice. A message transmitted to a second DS unit, which currently stores the initial parity slice, directs the second DS unit to store the updated parity slice.