Fixed Delay Cache Storage for Advertisement Exchange Systems
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Advertisement exchange systems face inefficiencies in data caching and storage due to the high volume and real-time nature of online advertisement insertion, leading to challenges in processing and generating billing information in a timely manner.
Innovation Solution
A method is introduced that uses a combination of hashing functions to determine the insertion location of keys in a cache, with an eviction criterion to ensure bounded insertion time, allowing for efficient insertion and retrieval of data within a fixed delay or number of steps, and utilizing associated timestamps or expiration criteria to manage cache operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If traditional data caching methods are used in high-volume real-time advertisement insertion systems, then the system can handle large volumes of data, but the processing time and insertion operations exceed fixed time intervals
Solution Approach 1:
The patent segments the cache into multiple regions or buckets, each with its own eviction policy. This segmentation allows parallel processing of insertion operations across different segments, reducing the overall insertion time while maintaining the ability to handle large data volumes. Each segment can be independently managed, preventing any single segment from becoming a bottleneck.
Solution Approach 2:
The system pre-allocates cache slots and pre-computes hashing values before actual data insertion occurs. By preparing the cache structure in advance and pre-calculating where data will be placed, the system minimizes the actual insertion time during real-time operations, ensuring that processing completes within fixed time intervals even under high volume conditions.
2Measurement precision
If complex eviction policies are implemented to manage cache collisions, then data retrieval accuracy improves, but the computational overhead and processing time increase
Solution Approach 1:
The patent changes the parameters of the eviction policy by using simple, fixed criteria such as time-based expiration or round-robin selection rather than complex algorithms. This parameter change reduces computational overhead and simplifies the eviction process while maintaining sufficient data retrieval accuracy through proper cache sizing and multiple hashing functions that distribute collisions effectively.
Solution Approach 2:
The system uses multiple hashing functions to create copies or alternative locations for data in the cache. Instead of relying on a single complex eviction policy, the patent employs multiple simpler hash functions that map keys to different cache locations, effectively copying the data placement strategy. This approach reduces collision handling complexity while maintaining retrieval accuracy through redundant positioning options.
3Productivity
If real-time processing is enforced for billing information generation, then customer satisfaction improves, but system resource consumption and operational complexity increase
Solution Approach 1:
The patent implements continuous cache operations where data insertion, retrieval, and eviction occur as ongoing background processes rather than batch operations. This continuity ensures that billing information is always available in real-time without requiring complex orchestration of periodic processing cycles. The cache continuously maintains data readiness, enabling immediate billing generation while simplifying system operations through steady-state processing.
Solution Approach 2:
The cache system is designed to automatically manage its own operations including data insertion, retrieval, and eviction without requiring complex external control mechanisms. The eviction policies and hashing functions operate autonomously based on predefined rules, allowing the system to self-regulate cache contents and maintain real-time billing capabilities without increasing operational complexity. This self-service approach enables real-time processing while keeping the system manageable through simple, rule-based automation.
Data Source
AI summary
Methods and systems for fixed delay storage operations such as lookup and insertion and their applications to advertisement exchange systems are disclosed. In one aspect, a method is provided for inserting a key into a corresponding location in a storage within a fixed delay. The method may determine the corresponding location for inserting the key by a first hashing function and a second hashing function. The method may also utilize an eviction criterion for evicting collided hashed values of the key to ensure the insertion time for operations related to inserting the key to be bounded by a fixed delay, which may be within a fixed time interval, or within a fixed number of steps.