{'fraction_non_alphanumeric': 0.017241379310344827, 'fraction_numerical': 0.0, 'mean_word_length': 5.060869565217391, '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}}
PARTES: A partitioning scheme for parallel matching

Focuses on the partitioning of rules for parallel matching in a production system. The approach, called PARTES, applies the min-cut technique to a dataflow discrimination network (DDN) that represents the antecedents of the rules. The goal is to maximize the sharing of memory nodes within a partition while minimizing the duplication of nodes across partitions. The authors illustrate the technique using a cost model based on shared memory nodes defined in a DDN created by the Rete algorithm. A generalization to any other algorithm utilizing a DDN is straightforward. A performance analysis is provided to show the effectiveness of PARTES.