Key-Value File Storage for Unlimited Directory Expansion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional tree-structure data storage systems face bottlenecks in data access performance and uncontrollable data distribution, especially when dealing with large amounts of data, leading to inefficiencies in network file systems like NFS, QQ album, and cloud storage services.
Innovation Solution
A method and apparatus that utilize a primary key to store meta-data information and generate secondary keys for sub-folder lists and file lists, allowing for 'open-ended' expansion and uniform distribution of data across multiple keys, thereby enhancing storage stability and accessibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If conventional tree-structure data storage mode is used, then file management and indexing are simplified, but data access performance encounters bottlenecking when the number of folders or files increases
Solution Approach 1:
The patent segments the data storage structure by introducing multiple levels of key-value databases (first level, second level, third level) to divide and organize folder and file data. This segmentation allows data to be distributed across multiple storage modules, preventing bottlenecks while maintaining manageable indexing through the hierarchical key structure.
2Ease of operation
If conventional tree-structure data storage mode is used, then indexing and file management are easier, but data distribution becomes uncontrollable
Solution Approach 1:
The patent implements dynamic data distribution through configurable key-value databases at multiple levels. The system can dynamically allocate and balance data across different storage modules based on capacity and access patterns, while the hierarchical key structure (folder keys, subfolder keys, file keys) maintains controllable and adaptable indexing.
3Device complexity
If fixed rules are used for allocating network storage modules, then routing is simplified, but data storage expansion is limited
Solution Approach 1:
The patent adds dimensional depth to the storage architecture by introducing multiple levels of key-value databases (first level, second level, third level) rather than relying solely on fixed rules. This multi-level hierarchical structure enables scalable data storage expansion while maintaining simplified routing through the organized key hierarchy.
Data Source
AI summary
A method and apparatus for file storage is disclosed, wherein the method comprises: recording meta-data information of a folder, and storing the meta-data information into key-value databases; and, when the folder includes at least one sub-folder list and/or file list thereunder, storing the contents of the at least one sub-folder list and/or file list included under the folder in secondary keys based on the primary key. The method achieves “open ended” unlimited expansion of data in a directory tree storage. The use of the “open ended” unlimited data expansion scheme avoids bottlenecks related to underlying data storage when accumulated data become large. In comparison with the prior art method, the method splits and stores large data into multiple secondary keys for uniform data distribution, thereby enhances storage stability of storage databases and facilitates data expansion and systems' transaction operations.