File System Namespace Compression via Leaf Page Merging
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing file system namespace in storage systems becomes inefficient due to unevenly distributed updates, leading to wasted storage space and performance degradation caused by sparse leaf pages in hierarchical data structures like B+ trees, which are difficult to compress without costly snapshotting processes.
Innovation Solution
A method for compressing file system namespaces by identifying sparse leaf pages and merging them with adjacent pages when the combined size falls below a certain threshold, using a namespace compressor to determine sparse pages and perform merging operations during low system activity levels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If files and directories are continuously added and deleted from the storage system, then the file system namespace is continuously updated, but the namespace becomes stored inefficiently and wastes storage space
Solution Approach 1:
The patent merges adjacent leaf pages in the B+ tree hierarchical data structure to eliminate sparse pages. When a leaf page becomes sparse after deletions, the system identifies adjacent leaf pages and merges them into a single page, consolidating namespace entries and eliminating wasted storage space while maintaining efficient access patterns.
2Ease of manufacture
If snapshotting is used to compress file system namespace, then compression can be performed, but it incurs costly performance overhead
Solution Approach 1:
The patent extracts the compression function from the expensive snapshotting process and integrates it directly into the namespace update operations. By performing leaf page merging during low-activity periods and incorporating compression into the normal namespace maintenance workflow, the system eliminates the need for separate, costly snapshotting operations while maintaining compression capability.
3Loss of substance
If leaf pages are merged frequently to eliminate sparse pages, then storage efficiency improves, but system performance may degrade during high activity levels
Solution Approach 1:
The patent implements periodic action by monitoring system activity levels and performing leaf page merging operations during low-activity periods. The system continuously monitors namespace changes and schedules merging operations when activity is low, ensuring storage efficiency improvements without degrading system performance during high-demand periods.
Data Source
AI summary
A computer-implemented method is implemented to compress a file system namespace. The method starts with determining that a first leaf page of a hierarchical data structure of a storage system is sparse. The hierarchical data structure contains root node layer, intermediate node layer, and leaf page layer, where each leaf page contains namespace entries corresponding to a file or a directory of a file system, and where being sparse means a first size of the entries of the first leaf page is less than a first percentage. The method continues with identifying a second immediate adjacent leaf page as a merging candidate. The method continues with merging the second leaf page into the first leaf page upon determining that a second size of combined entries of the first and second leaf pages is less than a second percentage larger than the first percentage.