{'fraction_non_alphanumeric': 0.01871440195280716, 'fraction_numerical': 0.0, 'mean_word_length': 5.612903225806452, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Symbiotic Cache Refreshment in Single-Cache Multiple-Source Environments

As new breeds of information sources, such as wireless sensor networks, mushroom and get integrated into today’s computing infrastructure, more data caches and warehouses are being used as an “information choke point,” making proper cache synchronization ever important. However, in many cases, physical resource constraints existing between a cache and its data sources require out-of-date data objects be tolerated. Consequently, cache synchronization should try to minimize overall cache divergence within the envelope of available resources. This paper presents a cache refreshment scheme which benefits both the cache and the data sources in terms of resource usage. We approximate the problem of best-effort cache refreshment in single-cache multiple source environments to an optimization problem in a discrete time space and justify the reasoning. A solution to the problem is sought and its optimality shown when certain conditions on update patterns are assumed. Cache refreshment using explicit polling is proposed as a practical incarnation of the solution and its effectiveness validate through extensive simulation with realistic parameters.