File System Identifier Space Segmentation for Metadata Overhead Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current file systems face inefficiencies in metadata management and deduplication processes due to the use of single identifier spaces, which can lead to increased overhead and reduced performance in identifying and handling duplicate data units.
Innovation Solution
Implementing multiple identifier spaces within a file system, where hash-based identifiers are used for deduplicated data units and non-hash-based identifiers are used for non-deduplicated units, allowing for reduced metadata storage and improved efficiency by leveraging hash values directly as identifiers for deduplicated data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single identifier space is used for all data units, then the file system structure is simple, but metadata overhead increases and deduplication efficiency decreases
Solution Approach 1:
The patent segments the identifier space into multiple distinct identifier spaces (e.g., hash-based identifier space and non-hash-based identifier space). Each identifier space is dedicated to specific types of data units based on their deduplication status. This segmentation reduces metadata overhead by eliminating the need for separate logical identifier mappings for deduplicated data, as hash values directly serve as identifiers in the hash-based identifier space.
2Ease of manufacture
If a single identifier space is used for all data units, then implementation is straightforward, but deduplication performance is reduced
Solution Approach 1:
The patent divides the identifier management system into separate identifier spaces that specialize in different functions. The hash-based identifier space is optimized for deduplicated data units, enabling fast lookup and comparison through hash-based indexing. The non-hash-based identifier space handles non-deduplicated data units. This functional segmentation improves deduplication performance by allowing the system to directly compare hash values rather than performing full data unit comparisons.
Solution Approach 2:
The patent applies different identifier management strategies to different types of data units based on their local characteristics. Data units that are candidates for deduplication are assigned identifiers from the hash-based identifier space, while data units not suitable for deduplication receive identifiers from the non-hash-based identifier space. This local quality approach optimizes the identifier system for the specific needs of each data unit type.
3Quantity of substance
If hash values are used directly as identifiers for deduplicated data, then metadata storage is reduced, but multiple identifier spaces must be managed
Solution Approach 1:
The patent introduces a new dimension to the identifier system by creating multiple orthogonal identifier spaces rather than extending the single identifier space. Each identifier space operates independently with its own naming conventions and management rules. This dimensional approach allows hash values to be used directly as identifiers without conflicting with traditional logical identifier requirements, as they exist in different identifier space dimensions.
Data Source
AI summary
It is determined that a first data unit is to be written to a storage device and that the first data unit is associated with a first attribute. In response to determining that the first data unit is associated with the first attribute, a first identifier is selected from a first identifier space and the first identifier is associated with the first data unit. It is determined that a second data unit is to be written to the storage device and that the second data unit is associated with the second attribute. In response to determining that the second data unit is associated with the second attribute, a second identifier is selected from a second identifier space and the second identifier is associated with the second data unit.


