{'fraction_non_alphanumeric': 0.01837270341207349, 'fraction_numerical': 0.0, 'mean_word_length': 5.104, '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}}
An Efficient Optimization Approach for Top-k Queries on Uncertain Data

Uncertain data is inherent in various important applications and Top-k query on uncertain data is an important query type for many applications. To tackle the performance issue of evaluating Top-k query on uncertain data, an efficient optimization approach was proposed in this paper. This method can anticipate the tuples most likely to become Top-k result based on dominant relationship analysis, greatly reducing the amount of data in query processing. When the database is updated, this method could determine whether the change affects the current query result, and help us to avoid unnecessary re-query. The experimental results prove the feasibility and effectiveness of this method.