{'fraction_non_alphanumeric': 0.014084507042253521, 'fraction_numerical': 0.0, 'mean_word_length': 5.467532467532467, '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}}
Web prefetching with high accuracy and low memory cost

Prefetching algorithms can effectively reduce Web latency and dramatically improve responsiveness of interactive Web application. We propose a new history-based prefetching algorithm that achieves very high prediction accuracy, generates little overhead traffic, and allows users to bound the amount of memory that it uses. We also propose a method to find accurate upper bounds on the performance of any history-based prefetching algorithm.