Code List Cache for Value Help
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing user interface systems face inefficiencies in providing value help, as they often rely on slower secondary storage for code lists, leading to slower access times and reduced responsiveness when users need assistance with inputting values.
Innovation Solution
Implementing a system where a code list provider determines whether to access a cache or secondary storage for code lists, with the cache storing about 70% of information for rapid retrieval, enhancing the user interface's ability to provide code list value help by keeping frequently used lists in memory.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If code lists are stored in secondary storage, then storage capacity is sufficient, but access time is slow
Solution Approach 1:
The patent segments the storage system into two parts: a cache memory for frequently accessed code lists and secondary storage for the complete code list repository. This segmentation allows the system to store a subset of code lists in high-speed cache memory, providing fast access for common queries while maintaining comprehensive storage capacity in secondary storage for the entire code list database.
Solution Approach 2:
The system performs preliminary action by pre-loading frequently accessed code lists into cache memory before they are actually needed. The cache memory is populated in advance with code lists that are likely to be requested, so when a user queries for these code lists, they are already available in high-speed memory, eliminating the need to access slower secondary storage.
2Speed
If all code lists are kept in cache memory, then access speed is fast, but memory usage increases
Solution Approach 1:
The patent applies local quality by providing different storage characteristics for different code lists based on their access patterns. Frequently accessed code lists are stored in high-speed cache memory, while less frequently accessed code lists remain in secondary storage. This creates a localized optimization where each code list is stored in the most appropriate memory type for its specific access requirements, rather than using a uniform storage approach for all code lists.
Solution Approach 2:
The system uses partial action by loading only a portion of the total code lists into cache memory - specifically, the subset that is most frequently accessed. Rather than loading all code lists into cache (which would be excessive and waste memory), the system selectively loads only the necessary portion that provides the most benefit to access speed, accepting that some code lists will occasionally require secondary storage access.
3Productivity
If code lists are retrieved from secondary storage, then complete data is available, but system responsiveness decreases
Solution Approach 1:
The system performs preliminary action by pre-loading frequently accessed code lists into cache memory before they are actually needed. The cache memory is populated in advance with code lists that are likely to be requested, so when a user queries for these code lists, they are already available in high-speed memory, eliminating the need to access slower secondary storage.
Solution Approach 2:
The cache memory serves as an intermediary between the user interface and the secondary storage. When a code list is requested, the cache acts as a buffer that can immediately satisfy the request if the code list is present, otherwise it retrieves from secondary storage. This intermediary layer protects the system from the slow access times of secondary storage for frequently accessed data, improving overall system responsiveness.
Data Source
AI summary
Methods and apparatus, including computer program products, are provided for providing value help. In one aspect, there is provided a computer-implemented method. The method may include receiving, at a code list provider, a request from a user interface for code list value help; determining, based on the request, whether to access at least one of a cache and a secondary storage; accessing, by the code list provider, a cache including at least a first code list, the cache implemented in memory, when the determination results in access to the cache; accessing a secondary storage including at least a second code list, when the determination results in access to the secondary storage; and sending, by the code list provider, at least one of the first code list and the second code list to a user interface to enable the user interface to provide code list value help. Related apparatus, systems, methods, and articles are also described.


