Compression Virtual Block Metadata Mapping for Storage I/O
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current information storage and management techniques face challenges in efficiently handling compressed data, particularly in determining the correct addresses for I/O requests in storage systems, which affects reliability and efficiency.
Innovation Solution
The method involves receiving I/O requests for compressed data portions and determining whether they include a first or second portion of information to obtain addresses via downward or upward mapping, using file system IDs, inode numbers, and file block offsets to locate compression Virtual Block Metadata and verify mappings, ensuring accurate execution of requests at the compressed data portions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If downward mapping is used to obtain addresses for compressed data portions, then the mapping process can handle file system IDs, inode numbers, and file block offsets, but the system complexity increases due to the need to locate and verify compression Virtual Block Metadata
Solution Approach 1:
The patent introduces compression Virtual Block Metadata as an intermediary structure that bridges file system concepts (inodes, block offsets) and physical storage addresses. This metadata layer simplifies the mapping process by providing a standardized interface that handles the complexity of compressed data location internally, while presenting a uniform access method to the filesystem.
Solution Approach 2:
The mapping process is segmented into distinct operational paths (downward mapping for file system-based requests, upward mapping for address-based requests). Each segment handles specific request types with optimized processing logic, reducing overall system complexity by avoiding a single monolithic mapping mechanism that would need to handle all cases.
2Reliability
If upward mapping is used to obtain addresses for compressed data portions, then the mapping process can verify mappings using inode numbers and file block offsets, but the processing time increases due to additional verification steps
Solution Approach 1:
The system performs preliminary actions by pre-computing and storing compression Virtual Block Metadata that includes verification information (inode numbers, file block offsets) alongside physical addresses. This metadata is prepared in advance during data compression and storage operations, so that during I/O operations, the verification can be performed quickly by simply checking pre-stored metadata rather than computing verification information on-demand.
3Adaptability or versatility
If the system implements both downward and upward mapping for compressed data portions, then I/O request handling becomes more flexible, but the device complexity increases due to multiple mapping mechanisms
Solution Approach 1:
The compression Virtual Block Metadata structure serves multiple functions simultaneously: it stores physical addresses for upward mapping, contains verification information for reliability checks, and provides the intermediary interface for downward mapping. This multi-functional metadata structure reduces the need for separate specialized components for each mapping direction, thereby reducing overall system complexity while maintaining flexibility.
Data Source
AI summary
A method, computer program product, and computer system for receiving, at a computing device, an I/O request directed to a compressed data portion of a storage system. It may be determined whether the I/O request includes one of a first portion of information and a second portion of information. An address of the compressed data portion may be obtained via downward mapping if the I/O request includes the first portion of information. The address of the compressed data portion may be obtained via upward mapping if the I/O request includes the second portion of information. The I/O request may be executed at the compressed data portion.