{'fraction_non_alphanumeric': 0.027710843373493974, 'fraction_numerical': 0.004819277108433735, 'mean_word_length': 5.295454545454546, '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}}
Self‐tuning caching: the Universal Caching algorithm

A cache replacement policy is normally suited to a particular class of applications, or limited to a set of fixed criteria for evaluating the cache‐worthiness of an object. We present Universal Caching as a mechanism to capture the generality of the most adaptive algorithms, while depending on a very limited set of basic criteria for cache‐replacement decisions. Our testing was limited to Web workloads, where we tested the Universal Caching policy using real‐world traces from both the server‐side and client‐side proxies. Using a self‐tuning mechanism, combined with a generalization of the criteria employed in GD‐* Web caching, Universal Caching was able to consistently outperform any other fixed choice of algorithm we tested. Copyright © 2006 John Wiley & Sons, Ltd.