{'fraction_non_alphanumeric': 0.03017832647462277, 'fraction_numerical': 0.0, 'mean_word_length': 5.636363636363637, '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}}
Sub-order Non-duplication Event Matching Algorithm for Stateful Publish/Subscribe Systems

To resolve high-performance content-based composite event matching problem for publish/subscribe systems, we propose the sub-order non-duplication (SOND) algorithm based on the non-deterministic finite automata (NFA) and pipelining technology. This algorithm makes use of the reproducibility of atomic events and the selectivity of atomic events, to reduce the number of atomic predicates to be evaluated and then to improve the efficiency of composite event matching. Experimental results show that the SOND algorithm is better than random non-duplication (RND) algorithm in performance of large scale stateful publish/subscribe systems.