{'fraction_non_alphanumeric': 0.011940298507462687, 'fraction_numerical': 0.0, 'mean_word_length': 5.532467532467533, '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}}
Dynamic Data Partitioning Strategy Based on Heterogeneous Flink Cluster

As a popular big data stream processing engine, Apache Flink has obvious advantages in stream data processing. The data partitioning strategy of Flink stream processing jobs ignores metrics such as heterogeneous cluster, real-time computational resources of nodes and communication delays between nodes, which can easily cause load imbalance problems. In this paper, we propose a dynamic data partitioning strategy for stream processing jobs based on heterogeneous Flink cluster for adjusting the data load among nodes. The strategy dynamically adjusts the ratio of data processed by each node according to the real-time resource information, communication delay and hardware information of each node, so that the data load among nodes is at a relatively balanced level after multiple rounds of feedback adjustment. The experimental results show that the strategy can effectively improve the throughput and reduce latency of the job