Storage Chunk Deallocation Using Deleted-Object Metadata
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Data storage systems face challenges in efficiently deallocating storage resources when data chunks need to handle portions of data objects differently, leading to inefficiencies in managing storage and retrieval operations.
Innovation Solution
A data storage system that utilizes metadata to select between immediate and reference deallocation approaches based on the metadata of deleted objects, allowing chunks to be deallocated without copying data or with data copying, depending on the metadata indicating the number of referencing objects.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data chunks are used to store data from multiple data objects, then storage space utilization is improved, but deallocation complexity increases because portions of chunks may need to be handled differently
Solution Approach 1:
The patent applies preliminary action by maintaining metadata that is updated in advance to reflect current data object references to storage chunks. When a data object is deleted, the metadata already contains accurate reference information, allowing the system to immediately determine whether a chunk can be deallocated without complex real-time analysis of which data objects reference which chunks. This pre-maintained metadata eliminates the need for complex deallocation logic.
2Speed
If immediate deallocation is performed without copying data, then deallocation speed is improved, but data loss risk increases if other objects reference the chunk
Solution Approach 1:
The patent implements feedback by using metadata that continuously reflects the reference status of storage chunks. Before deallocation, the system queries the metadata to receive feedback about whether other data objects reference the target chunk. Based on this feedback, the system selectively performs immediate deallocation (when no references exist) or reference deallocation with data copying (when references exist). This feedback mechanism enables fast deallocation when safe and prevents data loss when references are present.
3Reliability
If reference deallocation with data copying is performed, then data integrity is maintained, but deallocation time increases
Solution Approach 1:
The patent applies partial action by performing reference deallocation with data copying only for the specific portions of chunks that are still referenced by remaining data objects. Instead of copying entire chunks unnecessarily, the system uses metadata to identify and copy only the necessary data portions that maintain data integrity. This selective partial copying reduces deallocation time while still ensuring data integrity is maintained.
Data Source
AI summary
The technologies described herein are generally directed toward deallocating storage resources based on metadata of a deleted object. In an embodiment, a method can include, based on an indication that a data object stored using storage resources of a data storage system is to be deleted, identifying metadata of a first chunk of storage of the data storage system. The method can further include based on the metadata of the first chunk of storage, selecting a deallocation approach from different deallocation approaches, the deallocation approach usable to designate the first chunk of storage as available for storage of one or more other data objects. Further, the method can include facilitating designation of the first chunk of storage as being available for the storage of the one or more other data objects in accordance with the deallocation approach.