LUN and ID Mapping for Faster Data Restoration Reads
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In existing data backup scenarios, the non-consecutive nature of fingerprints in data storage leads to inefficient data reading speeds due to repeated searches in the fingerprint table during data restoration, resulting in low reading performance.
Innovation Solution
Implement a data processing method that utilizes a LUN mapping table for consecutive ID allocation based on physical addresses, coupled with an ID mapping table for continuous physical address retrieval, reducing the need for repeated table searches and enhancing reading efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored based on fingerprints with non-consecutive allocation, then data integrity and uniqueness are ensured, but the reading speed deteriorates due to repeated table searches
Solution Approach 1:
The patent introduces an ID mapping table as an intermediary layer between the fingerprint table and physical address storage. The ID mapping table stores consecutive ID sequences that map to physical addresses, allowing the system to maintain fingerprint-based data integrity while enabling sequential access through continuous ID sequences. This intermediary structure eliminates the need to search the fingerprint table for each data retrieval operation.
Solution Approach 2:
The patent segments the address mapping functionality into two separate tables: the fingerprint table (maintaining data uniqueness) and the ID mapping table (enabling sequential access). By dividing the monolithic address mapping structure into specialized segments, each table can optimize for its specific function - the fingerprint table ensures data integrity while the ID mapping table provides fast sequential retrieval.
2Measurement precision
If the fingerprint table is searched for each fingerprint during data restoration, then accurate physical address retrieval is achieved, but the productivity deteriorates due to multiple repeated searches
Solution Approach 1:
The system performs preliminary action by pre-establishing the ID mapping table with consecutive ID sequences mapped to physical addresses during the data writing phase. This preliminary structuring of address mappings allows the restoration process to simply follow the sequential ID sequence without performing repeated search operations, significantly improving restoration productivity while maintaining accuracy.
3Productivity
If consecutive physical addresses are allocated based on ID sequences, then batch retrieval efficiency is improved, but the device complexity increases due to additional mapping tables
Solution Approach 1:
The ID mapping table serves multiple functions: it provides sequential access to data, enables batch retrieval operations, and maintains the mapping between logical ID sequences and physical addresses. By designing this single structure to fulfill multiple roles, the patent achieves batch retrieval efficiency without proportionally increasing system complexity.
Data Source
AI summary
A task processing method comprising obtaining a first identifier (ID) sequence from a logical unit number (LUN) mapping table based on logical addresses of first data, where IDs in the first ID sequence are allocated based on a sequence of physical addresses, where the LUN mapping table includes mapping relationships between the logical addresses and the IDs; obtaining first physical addresses from an ID mapping table based on one ID in the first ID sequence when the IDs in the first ID sequence are consecutive, where the ID mapping table includes a mapping relationship between an ID and a physical address and the first physical addresses are a plurality of physical addresses corresponding to the first ID sequence; and reading the first data based on the first physical addresses.