Graph-Based Path Translation for HTTP Cache Coherency
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current caching schemes for web-based applications over HTTP are not well-suited to handle multiple concurrent data requests efficiently, leading to high network latency and bandwidth usage due to bulky HTTP headers and limited concurrent connections.
Innovation Solution
A method and system that utilize graph-based data representations to translate paths, allowing for efficient caching by associating payload data with a unique path, enabling flexible access and maintaining cache coherency by translating all paths to a single unique path, thus reducing bandwidth consumption and improving concurrent request handling.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If traditional HTTP caching schemes are used, then cache implementation is simple, but bandwidth consumption increases due to bulky HTTP headers
Solution Approach 1:
The patent extracts the essential data identification elements (paths) from the complete HTTP request-response cycle, caching only the critical path information rather than entire HTTP messages. This eliminates the need to transmit and cache bulky HTTP headers while retaining the ability to identify and retrieve payload data efficiently.
Solution Approach 2:
The patent segments the HTTP communication into distinct components: paths (for caching and identification), translations (for path resolution), and payload data (for actual content delivery). This segmentation allows each component to be optimized independently, with paths being compact and cacheable while payload data is retrieved only when needed.
2Device complexity
If web browsers support limited concurrent HTTP connections, then connection management is simplified, but request processing speed decreases
Solution Approach 1:
The patent performs preliminary actions by caching paths and their translations before actual payload data is requested. When multiple concurrent requests arrive, the system can quickly resolve paths using pre-cached translations, enabling parallel processing of multiple requests without increasing the number of concurrent HTTP connections.
Solution Approach 2:
The patent introduces a path translation mechanism as an intermediary layer between the client and the server. This translation layer caches and resolves paths locally, allowing multiple concurrent requests to be processed through a single HTTP connection by translating paths to payload data identifiers without establishing multiple parallel connections.
3Stability of the object's composition
If HTTP requests are processed in serial, then request processing order is maintained, but overall processing time increases
Solution Approach 1:
The patent performs path translations in advance and caches them, so when multiple requests arrive, the actual payload data retrieval can proceed in parallel while maintaining logical processing order through the cached translation mappings. This allows quick-processed requests to be fulfilled earlier without disrupting the overall processing sequence.
4Quantity of substance
If path translations are not cached, then cache memory usage is reduced, but repeated path resolution increases network latency
Solution Approach 1:
The patent creates compact copies of path translation mappings and stores them in local cache memory. These copies are lightweight data structures that map paths to payload data identifiers, consuming minimal memory while enabling rapid local resolution without repeated network round trips for the same path translations.
Data Source
AI summary
Embodiments of the invention generally provide a method, a computing system, and a computer-readable medium configured to request, cache, and generate translations of paths through graph-based data representations. The computer-implemented method includes receiving a first request for translation, wherein the first request specifies a first path configured to identify first payload data. The computer-implemented method further includes determining whether a graph object stored in the local cache memory includes a first translation associated with the first path. If the local cache memory does not include the first translation, then the first translation is obtained from a remote computing device and stored in the graph object. If the local cache memory does include the first translation associated with the first path, then the first translation is obtained from the local cache memory. The computer-implemented method also includes obtaining the first payload data based on the first translation.