{'fraction_non_alphanumeric': 0.017316017316017316, 'fraction_numerical': 0.0, 'mean_word_length': 5.045751633986928, '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}}
Study on the Similarity Query Based on LCSS over Data Stream Window

Aiming at the problem that the NAIVE algorithm which is taken to handle the similarity query based on LCSS over data stream window (SQLSW) cannot get query results until calculations on all elements in the full dynamic programming matrix are finished, the SQLSW query processing algorithm based on Possible Solution domain optimization strategy (SQLSW-PS) is proposed. It defines possible solution (PS) domain of the dynamic programming matrix about every window. Based on characters of matrix members in the PS domain and the similarity query, it can get query result on the condition that the LCSS similarity function value has not been obtained yet, and reduce lots of computations related to matrix members. It is revealed by extensive experiments that the SQLSW-PS outperforms current algorithms in time, and is effective in handling the SQLSW query.