Web Cache Optimization via Anticipatory Data Combination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current caching methods for website data search either have a low cache usage rate or result in resource wastage due to excessive data storage, failing to balance efficiency and resource management effectively.
Innovation Solution
A method and system that generate combinations of dataset elements for caching, where application data is retrieved from the database only when needed and stored in the cache for subsequent use, ensuring that the most likely data is cached after the first search request, thereby optimizing cache usage and resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If only the requested application data is stored in cache, then the cache size is kept small, but the cache usage rate is low and search speed cannot be effectively increased
Solution Approach 1:
The patent applies preliminary action by proactively caching related application data before it is actually requested. When a user requests data for a specific condition combination, the system not only caches the requested data but also pre-caches data for related condition combinations that are likely to be requested next. This anticipatory caching strategy ensures that subsequent search operations can be served from cache, thereby increasing search speed without requiring the cache to store all possible data combinations.
2Productivity
If all relevant application data is stored in cache, then the cache usage rate is significantly increased, but a huge amount of data is cached causing resource waste
Solution Approach 1:
The patent applies local quality by making the cache content adaptive and context-specific rather than uniform. The system analyzes the actual access patterns and user behavior to dynamically determine which related data combinations should be cached. Instead of caching all possible data combinations uniformly, the system selectively caches only those combinations that are locally relevant based on the current search context and historical access patterns. This selective caching approach increases cache usage rate while minimizing storage resource waste.
3Loss of time
If comprehensive data is cached for all condition combinations, then subsequent searches can be quickly retrieved, but most cached data remains unused in practical applications
Solution Approach 1:
The patent applies feedback by implementing a monitoring mechanism that tracks actual cache access patterns and user search behavior. The system continuously collects feedback on which cached data combinations are actually used and which remain unused. Based on this feedback, the system dynamically adjusts the caching strategy, refining the selection of related data combinations to cache. This feedback-driven approach ensures that cached data is both quickly retrievable (maintaining low retrieval time) and practically useful (minimizing unused cached data).
Data Source
AI summary
A method of preparing application data for visitors of a website is performed at a computer server. The computer server receives a webpage request initiated by a client device, the webpage request including a first element from a first dataset and a second element from a second dataset. In response, the computer server generates two sets of combinations between the first and second elements and respective elements of the second and first datasets, respectively. The computer server queries a cache for application data associated with each combination of elements. For each combination that returns a cache miss, the computer server retrieves the associated application data from an application database and stores the application data in the cache. The computer generates a response using application data associated with the first and second elements and returns the response to the client device.