{'fraction_non_alphanumeric': 0.029411764705882353, 'fraction_numerical': 0.0, 'mean_word_length': 5.115384615384615, '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}}
Uncertainties in Publish / Subscribe System

In this proposal, we introduce a scalable distributed publish/subscribe system for selective information dissemination. We propose two models A-ToPSS and G-ToPSS for two different matching problems: approximate matching and semantic matching. A-ToPSS aims at processing uncertainty information, while G-ToPSS aims at filtering graph-based metadata. We describe problems left in these two models and make a plan for the future work.