Overlapping Data Cache for Object API Requests
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing API caching systems are data-agnostic and unaware of object relationships, leading to inefficiencies in storing and retrieving response data across multiple API requests, resulting in unnecessary calls to data services and increased latency.
Innovation Solution
Implementing an overlapping data cache that maps object request graphs onto a cache as a set of entries, using object identifiers to store and retrieve sub-graph objects and their relationships, allowing for efficient retrieval of response data from cache for overlapping requests and reducing calls to data services.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If data-agnostic caching systems are used, then implementation simplicity is maintained, but retrieval efficiency deteriorates due to inability to recognize overlapping object relationships
Solution Approach 1:
The patent segments the monolithic caching system into multiple hierarchical cache levels (L1, L2, L3 caches) with specialized functions. Each cache level handles specific types of data or access patterns, allowing the system to maintain simplicity at each level while achieving high retrieval efficiency through coordinated multi-level caching with object relationship awareness
Solution Approach 2:
The patent introduces an object graph parser and relationship detector as intermediary components between the data service and cache system. These intermediaries analyze API requests, identify overlapping object relationships, and enable intelligent cache retrieval without requiring complete system redesign, thus maintaining implementation feasibility while improving efficiency
2Measurement precision
If comprehensive object relationship tracking is implemented, then cache retrieval accuracy is improved, but system complexity increases
Solution Approach 1:
The patent implements preliminary parsing of API requests into object graphs before cache lookup. By pre-identifying object relationships and potential overlaps in the request structure itself, the system achieves high detection accuracy without requiring complex real-time analysis during cache operations, thus managing system complexity effectively
3Reliability
If frequent calls to data services are made, then data freshness is maintained, but latency increases
Solution Approach 1:
The patent merges multiple API requests that share overlapping object relationships into a single cache lookup operation. By combining retrieval efforts for related objects and using multi-level caching to serve overlapping data, the system reduces the number of data service calls while maintaining data freshness, thereby significantly reducing latency
Solution Approach 2:
The system performs preliminary cache checks for overlapping objects before making data service calls. By pre-identifying which objects can be served from cache based on relationship analysis, the system avoids unnecessary data service calls and reduces latency while ensuring that fresh data is retrieved only when absolutely necessary
Data Source
AI summary
Systems and methods that may be used to implement overlapping data caching for object application program interfaces (APIs). A unique identifier may be assigned to each sub-component of an object API request. The unique identifiers may be used to determine if sub-components of one object API request overlaps with a sub-component of a prior different request such that a data response for the prior different request can be retrieved from the cache and used as part of the data response for the current object API request.