Coded Fragment Updates for Distributed Storage Version Control

The patent segments the file update process by dividing the file into fragments and applying erasure coding to generate coded fragments. When updates are needed, only the affected coded fragments are identified and transmitted, rather than recoding the entire file. This segmentation allows selective updates that reduce network strain while maintaining data reliability through the distributed coded fragment storage.

The patent changes the parameter representation by storing coded fragments instead of complete file copies. When updates occur, the system modifies only the necessary coded fragments using erasure code mathematics, rather than storing entire new file versions. This parameter change in the storage representation reduces storage space requirements while preserving data reliability through the mathematical properties of erasure codes.

The patent creates a composite storage system that combines encoded and unencoded representations strategically. Coded fragments are stored in encoded form for efficient retrieval and update operations, while difference information is maintained in unencoded form for space efficiency. This composite approach allows the system to leverage both the space-saving benefits of unencoded differences and the operational benefits of encoded storage for seamless file updates.

The patent implements version control by nesting difference information within the coded fragment structure. Instead of storing complete separate versions of files, the system stores coded fragments that can represent multiple versions through layered difference encoding. This nested structure allows version control capability while reducing storage use, as each coded fragment can serve multiple version requirements through mathematical transformations rather than requiring separate full-file storage for each version.