Key-Value Entry Creation for Fewer Time-Range Reads
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The number of reads from a key-value store increases when the time width of one entry is smaller than the time width specified in read requests, leading to inefficient data retrieval and increased processing time.
Innovation Solution
Determine a first time width equal to or greater than the longest time width among read requests and create an entry corresponding to a time range of this width, storing data in the key-value store to reduce the number of reads.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If the time width of one entry in the key-value store is set to a fixed value, then the data structure is simple and easy to manage, but the number of reads increases when read requests require longer time widths
Solution Approach 1:
The patent applies dynamics by making the time width of entries variable rather than fixed. The system dynamically determines the time width of each entry based on the maximum time width required by read requests. This allows the data structure to adapt to different access patterns, reducing the number of reads needed while maintaining manageability through automated determination of appropriate time widths.
Solution Approach 2:
The patent changes the parameter of time width from a fixed value to a variable that is determined based on read request requirements. By adjusting the time width parameter dynamically according to the maximum time width needed for data retrieval, the system optimizes the balance between structural simplicity and retrieval efficiency.
2Productivity
If the time width of one entry is increased to satisfy long time width read requests, then the number of reads decreases, but data retrieval precision deteriorates when shorter time widths are needed
Solution Approach 1:
The patent applies local quality by assigning different time widths to different entries based on their specific requirements. Instead of using a uniform time width for all entries, the system determines the time width of each entry locally based on the maximum time width required by read requests for that specific data range. This ensures that each entry has the appropriate time width for its purpose, maintaining precision while minimizing the number of reads.
3Measurement precision
If multiple small entries are created instead of one large entry, then data retrieval precision is maintained, but the number of reads and processing time increase
Solution Approach 1:
The patent uses dynamics to determine the optimal time width for each entry based on actual read request patterns. By dynamically adjusting entry time widths to match the maximum required width, the system avoids creating unnecessarily small entries that would require multiple reads, thereby reducing processing time while maintaining the ability to retrieve precise data when needed.
Data Source
AI summary
A method for creating an entry is performed by a computer. The method includes: determining a first time width equal to or longer than a longest time width among time widths to be read based on a read request from each program to a key-value store that holds data that corresponds to time, as a time width to be associated with one entry in the key-value store; and creating the entry that corresponds to a plurality of data that belongs to a time range of the first time width based on the data for each time and storing the entry in the key-value store.