No-Seek Data Slice Deletion via Catalog Verification

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing storage systems that utilize data slicing face inefficiencies in bulk deletion operations, as they often require multiple seeks to confirm the existence and location of each data slice, leading to increased time and resource utilization.

Innovation Solution

The implementation of a no-seek delete method, where a data slice can be deleted without confirming its existence at the storage location, by verifying that a record for the data slice exists in the catalog and that the pointer exclusively references a single data slice.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If traditional delete method is used to confirm existence and location of each data slice, then data deletion reliability is improved, but deletion time and resource utilization increase

Engineering Contradiction:

Improvedata deletion reliabilityVSAvoiddeletion time

Core Design Contradiction:

ReliabilityVSLoss of time

Solution Approach 1:

The system performs preliminary actions by maintaining a catalog that records the existence and location of each data slice before deletion operations. When a delete operation is initiated, the system checks the catalog to confirm the data slice exists and obtain its location pointer, rather than seeking to the storage location during the actual delete operation. This preliminary verification resolves the contradiction by ensuring reliability through pre-confirmation while avoiding time-consuming seeks during the critical deletion phase.

Inventive Principle:

Principle #10Preliminary action

2Reliability

If traditional delete method is used to confirm existence and location of each data slice, then data deletion reliability is improved, but resource utilization increases

Engineering Contradiction:

Improvedata deletion reliabilityVSAvoidresource utilization

Core Design Contradiction:

ReliabilityVSUse of energy by moving object

Solution Approach 1:

The system performs preliminary actions by maintaining a catalog that records the existence and location of each data slice before deletion operations. When a delete operation is initiated, the system checks the catalog to confirm the data slice exists and obtain its location pointer, rather than seeking to the storage location during the actual delete operation. This preliminary verification resolves the contradiction by ensuring reliability through pre-confirmation while avoiding resource-intensive seek operations during the critical deletion phase.

Inventive Principle:

Principle #10Preliminary action

3Productivity

If no-seek delete method is used to delete data slice without confirming existence, then deletion time and resource usage are reduced, but risk of deleting non-existent data increases

Engineering Contradiction:

Improvedeletion efficiencyVSAvoiddata deletion safety

Core Design Contradiction:

ProductivityVSReliability

Solution Approach 1:

The system introduces an intermediary catalog structure that mediates between the delete command and the physical storage location. The catalog serves as an intermediary layer that stores metadata including existence flags and location pointers for each data slice. During deletion, the system queries this intermediary catalog to verify existence and obtain location information before performing the actual delete operation, thus maintaining reliability while enabling efficient no-seek deletion.

Inventive Principle:

Principle #24Intermediary (Mediator)

4Productivity

If pointer exclusively references single data slice, then no-seek delete can be performed safely, but catalog structure complexity increases

Engineering Contradiction:

Improvedeletion efficiencyVSAvoidcatalog structure complexity

Core Design Contradiction:

ProductivityVSDevice complexity

Solution Approach 1:

The system applies segmentation by dividing the catalog into distinct records, each representing a single data slice with its own existence flag and location pointer. This segmentation allows the system to independently verify and delete individual data slices without affecting others, enabling safe no-seek deletion while maintaining a manageable catalog structure through clear separation of data slice information.

Inventive Principle:

Principle #1Segmentation

Data Source

PatentUS12321259B1Data slice deletion in storage systems

Publication Date: 2025.06.03 INTERNATIONAL BUSINESS MACHINE CORPORATION

AI summary

Described are techniques for performing no-seek deletes of data slices. The techniques include determining, in response to a request to delete a first data slice managed by a storage system, that a record for the first data slice exists in a catalog of the storage system. The techniques further include obtaining a pointer for the first data slice, the pointer referencing a storage location on a physical storage device. The techniques further include determining that the pointer exclusively references a single data slice stored at the storage location on the physical storage device. The techniques further include performing a no-seek delete of the first data slice in response to determining that the record for the first data slice exists in the catalog of the storage system and determining that the pointer references the single data slice.