Storage System Index Management via Time Slice Nodes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing storage system index management solutions are inefficient, particularly in handling expired events, as they require traversing all index nodes to find and remove expired data, leading to unsatisfactory performance and increased complexity.
Innovation Solution
Implementing a method that creates slice index nodes based on a flush cycle, where each node corresponds to a specific time slice, allowing for direct identification and removal of expired events, thereby simplifying the management and updating process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional index management methods are used to traverse all index nodes for removing expired events, then the storage system can maintain data integrity, but the system performance deteriorates due to extensive traversals and increased complexity
Solution Approach 1:
The patent segments the index structure by introducing time slice information, dividing the index into multiple time-based partitions. Each index node is associated with a specific time slice, allowing the system to directly identify and remove expired events by comparing time slices rather than traversing all nodes. This segmentation maintains data integrity through structured organization while significantly improving performance by eliminating exhaustive searches.
2Quantity of substance
If traditional index management methods are used to traverse all index nodes for finding expired events, then complete event coverage is achieved, but the device complexity increases due to complex traversal logic
Solution Approach 1:
The patent applies preliminary action by pre-organizing index nodes with time slice information during index creation and update operations. Instead of implementing complex traversal logic at query time, the system prepares the index structure in advance with time-based metadata, enabling straightforward identification of expired events through simple time slice comparison. This approach maintains complete event coverage while dramatically reducing operational complexity.
3Productivity
If time slice-based slice index nodes are created for direct identification of expired events, then the access efficiency improves by reducing traversals, but the manufacturing precision requirements increase for time slice management
Solution Approach 1:
The patent enhances the universality of the time slice mechanism by designing it to serve multiple functions simultaneously: organizing index nodes, tracking event expiration, enabling direct access to time-based data, and simplifying cleanup operations. This multi-functional design achieves high access efficiency through unified time slice management without requiring separate complex systems, thereby maintaining reasonable precision requirements while improving productivity.
Data Source
AI summary
Indices of storage systems are managed. An example method includes: receiving a flush cycle for flushing expired events in a storage system including multiple events in a data stream, determining, based on the flush cycle, a time slice for managing the index of the storage system, creating a slice index node for the time slice in response to determining that the occurrence time of a first event that enters the storage system in the data stream is within the time slice, wherein the slice index node includes an index node of the first event, and adding the slice index node to the index. A corresponding device and a corresponding computer program product are provided. Thus, the index of a large number of events entering the storage system is managed according to the occurrence time of the events, and the storage system can be searched and updated accurately and effectively.