Indexing Method for File Storage Using Increment and Total Quality Intervals
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing index management systems in distributed storage clusters face performance issues due to large key scopes, leading to reduced operating efficiency when handling massive files, as a single segment stores numerous indexes, resulting in delayed query operations.
Innovation Solution
The proposed method involves dividing the key interval into an increment interval and a total quality interval, where metadata is stored, allowing for efficient index operation requests by searching the increment interval first and processing requests through the total quality interval when necessary, thereby optimizing index management and improving performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If a single segment stores all indexes for massive files, then the storage structure is simple, but the operating performance of indexes is significantly reduced
Solution Approach 1:
The patent divides the index storage into multiple segments, each segment storing indexes for a specific key scope. This segmentation allows the system to handle massive files by distributing indexes across multiple manageable segments, improving index operating performance while maintaining storage structure through hierarchical organization of segment trees.
2Quantity of substance
If a segment includes a large key scope, then the storage capacity is increased, but too many indexes are stored in a single segment resulting in reduced operating performance
Solution Approach 1:
The patent introduces a hierarchical dimension to index storage by creating segment trees where each level represents a different granularity of key scope. This dimensional approach allows the system to maintain large storage capacity while enabling fast queries by traversing the hierarchical structure, thus improving index query speed without sacrificing storage capacity.
3Quantity of substance
If indexes are stored in a data center with distributed storage cluster, then the system can handle massive files, but the response time for file reading or writing requests is delayed
Solution Approach 1:
The patent pre-organizes indexes into segment trees with defined key scopes and hierarchical structures before query operations. This preliminary organization enables efficient navigation and reduces the time required to locate specific file indexes during read or write requests, thus reducing request response time while maintaining the ability to handle massive files through the distributed storage architecture.
Data Source
AI summary
Embodiments of the present disclosure provide an indexing implementing method in file storage, and the method includes: obtaining an index operation request of a file; searching an increment interval to determine whether the increment interval stores at least one piece of metadata corresponding to the file, making a response to the index operation request according to the at least one piece of metadata in the increment interval when the increment interval stores the at least one piece of metadata corresponding to the file, and processing the index operation request according to a total quality interval corresponding to the increment interval when the increment interval does not store the at least one piece of metadata corresponding to the file; wherein each piece of metadata comprises an index corresponding to the file. Further, an indexing implementing system in file storage is provided.