{'fraction_non_alphanumeric': 0.01674418604651163, 'fraction_numerical': 0.0, 'mean_word_length': 5.404761904761905, '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}}
Progressive Hash-Merge Join Algorithm

In data streams or Web scenario at highly variable and unpredictable rates, most fast join algorithms to date rely upon shifting to external join stage as soon as possible when blocked in order to enhance efficiency. But they have trouble with the following issues: the limit of external join and practical executing time. Classical progressive two-way joining technique based on hash, however, fail to deliver acceptable performance in such a scenario where relatively short intermittent delay exists in the gross. We propose a new progressive join algorithm based on hash-merge for improving the query response time, separating one merging transaction into multi-subtask, whose transacting sizes rest with the interval time. Additionally, a refined replacement selection tree and a fine granularity timestamp are applied, which help to make use of finite memory and ensure correctness respectively. Theory and experimental results show that our technique delivers results significantly fast under both reliable and unreliable network.