Virtual Block Mapping for Storage Relocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current storage technologies face inefficiencies in updating metadata for shared file system data blocks during relocation, compression, and encryption, leading to slower access times and increased I/O operations, especially when dealing with compressed and encrypted data.
Innovation Solution
The introduction of Virtual Block Mapping (VBM) pointers allows for dynamic reorganization of data blocks without altering block pointers in inodes and indirect blocks, enabling efficient relocation, compression, and encryption of shared data blocks by centralizing metadata updates through VBM pointers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If traditional block mapping is used for relocating file system data blocks, then data can be stored and accessed, but metadata updates become complex and time-consuming when dealing with shared, compressed, or encrypted blocks
Solution Approach 1:
The patent introduces Virtual Block Mapping (VBM) pointers as an intermediary layer between the file system metadata and the actual data blocks. Instead of updating block pointers directly in inodes and indirect blocks during relocation, the VBM pointers act as a buffer that absorbs these updates. The original block pointers remain unchanged, while VBM pointers are updated to point to new block locations, thereby decoupling the metadata update process from the actual data block relocation and significantly reducing metadata update time.
Solution Approach 2:
The patent segments the block mapping functionality into two distinct layers: traditional block pointers in the file system hierarchy (inodes and indirect blocks) and new VBM pointers that handle relocation, compression, and encryption operations. This segmentation allows each layer to have specialized responsibilities - the traditional layer maintains file system structure while the VBM layer handles dynamic block management, improving overall productivity without complicating the core file system metadata.
2Reliability
If shared data blocks are relocated by updating all block pointers, then data integrity is maintained, but I/O operations increase and performance decreases
Solution Approach 1:
VBM pointers serve as intermediaries that preserve data integrity while improving access speed. When a shared data block is relocated, only the VBM pointers are updated to reflect the new location, not all the block pointers in the file system hierarchy. This maintains data integrity through consistent pointer updates while avoiding the performance penalty of updating numerous metadata structures.
Solution Approach 2:
The patent creates a virtual copy of the block mapping information through VBM pointers. Instead of modifying the original block pointers in inodes and indirect blocks, the system creates and updates VBM pointer copies that reference the actual data blocks. This copying mechanism allows rapid relocation updates without affecting the original file system structure, thereby maintaining reliability while enhancing productivity.
3Quantity of substance
If compression and encryption are applied to shared data blocks, then storage efficiency improves, but metadata management becomes more complex
Solution Approach 1:
VBM pointers act as intermediaries that simplify metadata management for compressed and encrypted shared blocks. The VBM pointer structure includes fields to track compression status, encryption state, and block location information in a unified manner. This centralized metadata management through VBM pointers reduces the complexity that would otherwise arise from managing compression and encryption attributes across multiple scattered block pointers in the file system hierarchy.
Solution Approach 2:
The VBM pointer structure is designed as a universal metadata mechanism that handles multiple functions: tracking block location, compression status, encryption state, and sharing information all in one place. This multi-functional design consolidates what would otherwise require multiple separate metadata structures, thereby improving storage efficiency through compression and encryption while actually reducing rather than increasing metadata complexity.
Data Source
AI summary
A system and method of operating a storage server in a data network for relocating one or more data blocks of a file, comprising creating a virtual block mapping pointer; and relocating one or more file system data.