Batch Index Updates for Dispersed Storage Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Prior art data storage systems face inefficiencies due to conflicts in operations, leading to suboptimal performance and inefficient use of communication resources in dispersed storage networks.

Innovation Solution

A dispersed storage network (DSN) employing error encoding techniques like Cauchy Reed-Solomon encoding, where data is segmented into encoded data slices stored across multiple geographically dispersed units, allowing for efficient data storage and retrieval without loss, even with storage unit failures, and includes a managing unit for vault creation and integrity processing for error correction.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Productivity

If operations are performed individually in prior art data storage systems, then operation simplicity is maintained, but communication resources are used inefficiently and conflicts arise

Engineering Contradiction:
Improveoperation efficiencyVSAvoidoperation coordination complexity
Core Design Contradiction:
ProductivityVSDevice complexity

Solution Approach 1:

The patent combines multiple individual operations into batch operations. Index updates that would traditionally be performed individually are merged into batch index updates that are processed together, reducing the number of communication round trips and eliminating conflicts between simultaneous operations.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The patent introduces a preliminary indexing phase where index entries are created and validated before actual data storage operations begin. This preliminary action establishes the index structure in advance, allowing subsequent data operations to proceed without coordination conflicts.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If index updates are performed frequently to maintain data integrity, then data reliability is improved, but communication overhead and conflicts increase

Engineering Contradiction:
Improvedata integrityVSAvoidcommunication resource consumption
Core Design Contradiction:
ReliabilityVSLoss of energy

Solution Approach 1:

The patent implements periodic batch indexing where index updates are aggregated and processed at scheduled intervals rather than continuously. This periodic action maintains data integrity through regular updates while minimizing communication overhead by batching multiple updates into single periodic operations.

Inventive Principle:
Principle #19Periodic action

Solution Approach 2:

The patent incorporates feedback mechanisms where the indexing system monitors data changes and automatically determines when batch indexing should occur. This feedback-driven approach ensures index updates happen only when necessary to maintain integrity, avoiding unnecessary communication resources.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS10402423B2Sliding windows for batching index updates
Publication Date: 2019.09.03 PURE STORAGE INC
  • US10402423B2 patent drawing
  • US10402423B2 patent drawing
  • US10402423B2 patent drawing

AI summary

A computing device includes an interface configured to interface and communicate with a dispersed storage network (DSN), a memory that stores operational instructions, and processing circuitry operably coupled to the interface and to the memory. The processing circuitry is configured to execute the operational instructions to perform various operations and functions. The computing device determines a performance level that is based on updating of an index node that is associated with distributed storage within the DSN of a set of encoded data slices (EDSs) that is associated with a data object. When the computing device determines to modify an index node update time period based on the performance level that is based on the updating of the index node, the computing device further determines whether to shorten or lengthen the index node update time period and selectively/adaptively performs such shorten or lengthen operations based on such determination.