{'fraction_non_alphanumeric': 0.02294853963838665, 'fraction_numerical': 0.0, 'mean_word_length': 5.570776255707763, '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}}
New Approaches of Ranking Queries in Uncertain Databases

New applications such as sensor data monitoring and mobile device tracking, rise up the issue of uncertain data management. Compared to ―certain‖ data, the data in the uncertain database are not exact points, which, instead, often reside within a region. Here the study ranked queries over the uncertain data. The existing system such as decision making, recommendation raising, and data mining tasks proposes only for certain data. We define several fundamental properties including performance, radius range, unique-range, value-invariance and stability. Robust novel solutions speed up the probabilistic ranked query (PRank) with monotonic preference functions over the uncertain database. Specifically, Introduced two effective pruning methods: Spatial and Probabilistic pruning, these reduce the PRank search space. A special case of PRank with linear preference function is also studied and seamlessly integrate these pruning heuristics into the PRank query procedure. A preference function specified by users, a ranked query retrieves k data objects in the database such that their scores (calculated by the given preference function) are the highest. The proposed system tackles the PRank query processing over the join of two distinct uncertain databases. Extensive experiments will be conducted to demonstrate the efficiency and effectiveness in answering PRank queries.