Data Deletion Impact Assessment in Volume Backup Topology

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing data backup methods, such as those described in U.S. Pat. No. 8,429,140, do not account for cloud backup and fail to assess the impact of data deletion operations on policy compliance in volume backup, particularly in replication environments with shared upload volumes.

Innovation Solution

A management method that calculates and specifies the impact of data deletion by accessing API interfaces to collect data on primary, remote copy, and shared upload volumes, generating order topologies, and identifying sets of volumes affected by deletion operations, allowing users to anticipate and mitigate the impact of data deletion on backup processes.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Quantity of substance

If data deletion operations are performed without impact assessment, then storage space is freed up, but backup policy compliance and data protection are compromised

Engineering Contradiction:
Improvestorage spaceVSAvoidbackup policy compliance
Core Design Contradiction:
Quantity of substanceVSReliability

Solution Approach 1:

The system performs preliminary impact assessment before data deletion by tracing the data lifecycle through the topology graph. It identifies all remote copy volumes and shared upload volumes that will be affected by the deletion operation, allowing administrators to evaluate backup policy compliance and data protection implications before actually deleting the data.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If complex topology tracking is implemented to assess deletion impact, then backup policy compliance is ensured, but system complexity increases

Engineering Contradiction:
Improvebackup policy complianceVSAvoidtopology tracking system
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The system introduces a topology graph as an intermediary data structure that simplifies the tracking of data relationships. The graph nodes represent volumes (primary, remote copy, and shared upload volumes) and edges represent data flow relationships. This intermediary representation makes it easier to trace data lifecycles and assess deletion impact without requiring complex direct tracking of all volume relationships.

Inventive Principle:
Principle #24Intermediary (Mediator)

3Stability of the object's composition

If all remote copy volumes are deleted when primary volume data is deleted, then data consistency is maintained, but unintended data loss occurs in shared upload volumes

Engineering Contradiction:
Improvedata consistencyVSAvoidunintended data loss
Core Design Contradiction:
Stability of the object's compositionVSLoss of substance

Solution Approach 1:

The system applies different deletion policies to different types of volumes based on their specific roles in the data lifecycle. Remote copy volumes that are directly tied to the primary volume are deleted to maintain data consistency, while shared upload volumes that may contain data from multiple primary volumes are protected from deletion. This localized quality approach ensures each volume type is handled according to its specific function.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS12050521B2Management method
Publication Date: 2024.07.30 HITACHI VANTARA LTD
  • US12050521B2 patent drawing
  • US12050521B2 patent drawing
  • US12050521B2 patent drawing

AI summary

A management method includes accessing API interfaces and collecting data related to primary volumes, remote copy volumes, and shared upload volumes, generating order topology related to the primary, remote copy, and shared upload volumes, calculating a set P of the primary volumes storing data to be deleted and specifying a set Vd of the remote copy volumes directly related to the set P in the order topology, calculating, as a set C, all of the shared upload volumes related to the set P in the order topology and specifying a set Vi of all of the remote copy volumes related to the set C in the order topology, calculating a set Vid as the complementary set of the set Vd in the set Vi, and specifying a set Pid of the primary volumes one level higher than the set Vid in the order topology.