On-Demand Cache Management for Database Systems

Resolve Bottlenecks,
Find Innovative SolutionsGenerate Solutions

Solution Overview

Problem

Existing cache management techniques in database systems are insufficiently responsive to changing workload patterns, leading to inefficiencies in caching the most frequently accessed database data, as administrators struggle to predict which data will be accessed most often and periodic cache repopulation fails to keep up with real-time access patterns.

Innovation Solution

Implementing an on-demand cache management system that automatically tracks recent access patterns to dynamically update the derived cache, allowing for real-time caching of frequently accessed data and evicting less beneficial data to maintain optimal cache containment, thereby improving responsiveness to changing workloads.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Extent of automation

If periodic cache repopulation is used, then cache management is automated, but the system cannot respond to real-time changing workload patterns

Engineering Contradiction:

Improvecache management automationVSAvoidresponsiveness to changing workload patterns

Core Design Contradiction:

Extent of automationVSAdaptability or versatility

Solution Approach 1:

The patent implements dynamic cache management by transitioning from static periodic repopulation to a system that continuously monitors access patterns and dynamically adjusts cache contents in real-time based on changing workload demands

Inventive Principle:

Principle #15Dynamics

Solution Approach 2:

The system employs feedback mechanisms by monitoring access patterns and using this information to dynamically adjust cache repopulation decisions, creating a closed-loop control system that adapts to changing workloads

Inventive Principle:

Principle #23Feedback

2Productivity

If administrators manually predict access patterns, then cache contents can be optimized, but it requires significant administrator effort and expertise

Engineering Contradiction:

Improvequery execution speedVSAvoidadministrator effort for predicting access patterns

Core Design Contradiction:

ProductivityVSEase of operation

Solution Approach 1:

The system performs self-service by automatically monitoring access patterns and making intelligent cache management decisions without requiring administrator intervention or expertise in predicting access patterns

Inventive Principle:

Principle #25Self-service

Solution Approach 2:

The patent replaces the manual mechanical process of administrator prediction with an automated electronic monitoring and decision-making system that uses access pattern analysis

Inventive Principle:

Principle #28Mechanics substitution (Replace mechanical system)

3Productivity

If more data is cached in the derived cache, then cache containment improves, but memory resources are consumed

Engineering Contradiction:

Improvecache containmentVSAvoidmemory resources

Core Design Contradiction:

ProductivityVSQuantity of substance

Solution Approach 1:

The system dynamically changes the parameter of cache content by monitoring access patterns and selectively caching only the most frequently accessed data, adjusting cache contents based on real-time workload characteristics

Inventive Principle:

Principle #35Parameter changes

Data Source

PatentUS11354252B2On-demand cache management of derived cache

Publication Date: 2022.06.07 ORACLE INT CORP

AI summary

Techniques related to automatic cache management are disclosed. In some embodiments, one or more non-transitory storage media store instructions which, when executed by one or more computing devices, cause performance of an automatic cache management method when a determination is made to store a first set of data in a cache. The method involves determining whether an amount of available space in the cache is less than a predetermined threshold. When the amount of available space in the cache is less than the predetermined threshold, a determination is made as to whether a second set of data has a lower ranking than the first set of data by at least a predetermined amount. When the second set of data has a lower ranking than the first set of data by at least the predetermined amount, the second set of data is evicted. Thereafter, the first set of data is cached.