Logical Page Reconstruction in Storage Deduplication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Storage systems face challenges in efficiently managing logical address spaces, particularly in reconstructing corrupted root pages and maintaining data integrity across multiple storage devices, which affects deduplication and data availability.
Innovation Solution
The implementation of a mapper module that maintains a tree structure for logical page mappings, allowing for the identification and reconstruction of corrupted root pages by traversing horizontal and vertical relationships between logical pages, and adding namespace addresses to entries as needed to ensure data integrity and deduplication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of substance
If a logical address space is used to facilitate deduplication and storage management, then storage capacity efficiency is improved, but the complexity of managing and reconstructing corrupted logical pages increases
Solution Approach 1:
The logical address space is divided into multiple logical pages, each containing a limited number of entries (e.g., 256 entries). This segmentation allows the system to manage large address spaces in manageable units, reducing the complexity of handling corrupted pages while maintaining deduplication efficiency. When corruption occurs, only a single logical page needs to be reconstructed rather than the entire address space.
Solution Approach 2:
Namespace addresses are introduced as intermediary identifiers that map logical pages to physical storage locations. This intermediary layer decouples the logical address space management from physical storage details, simplifying the reconstruction process by providing a stable reference point even when physical storage changes or corruption occurs.
2Reliability
If root pages are reconstructed by traversing horizontal and vertical relationships between logical pages, then data integrity is improved, but the time and computational resources required for reconstruction increase
Solution Approach 1:
The system pre-establishes horizontal relationships (sibling page connections) and vertical relationships (parent-child page connections) between logical pages during normal operation. These relationships are maintained in the logical page structure itself, so when corruption is detected, the reconstruction process can immediately traverse these pre-built relationships without needing to perform complex searches or analyses, significantly reducing reconstruction time while maintaining data integrity.
3Measurement precision
If namespace addresses are added to entries in logical pages, then deduplication accuracy is improved, but the storage overhead and processing complexity increase
Solution Approach 1:
Namespace addresses are added selectively to specific entries within logical pages based on local requirements. Each logical page contains only the namespace addresses necessary for its specific deduplication needs, rather than uniformly adding them to all entries throughout the entire address space. This localized approach improves deduplication accuracy where needed while minimizing the overall processing complexity and storage overhead.
Data Source
AI summary
An apparatus comprises a processing device configured to obtain a first logical page and to obtain a first namespace address corresponding to a second logical page from the first logical page. The processing device is further configured to obtain the second logical page based at least in part on the first namespace address and to identify a given entry of a plurality of entries of the second logical page based at least in part on index information contained in the first logical page. The processing device is further configured to determine that the given entry comprises data other than a second namespace address corresponding to the first logical page and to add the second namespace address corresponding to the first logical page to the given entry based at least in part on the determination that the given entry comprises data other than the second namespace address.