{'fraction_non_alphanumeric': 0.015317286652078774, 'fraction_numerical': 0.0, 'mean_word_length': 5.017543859649122, '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}}
Balancing Memory Load in D-CAPE Using Replication-Style Distributed Partitioning of Operator States

Distributed continuous stream query systems have been shown to meet the needs of a range of high-volume applications. However, in some applications the stream queries for these applications may require a wide range of sizes of allocated memory. In such cases it may not be feasible to continue to store the data for any of the largest operators on a single machine. In addition, for the benefit of the users of such a system, we would like to offer as much flexibility in query processing as possible. This includes making full use of resources on the network, even with a highly fluctuating volume and distribution of data. This thesis proposal discusses an unexplored method of partitioning a query operator across several machines, without predetermining a destination for each new input for the operator. The proposed extension consists of the ability of the D-CAPE distributed continuous stream query system to activate a query plan operator on several machines simultaneously, and replicate new input data to each of these operators. Experiments will be conducted to observe the limits of high-volume query processing in D-CAPE with and without these new extensions, and to experimentally optimize these limits through the manipulation of several internal options.