{'fraction_non_alphanumeric': 0.0225, 'fraction_numerical': 0.0, 'mean_word_length': 5.321052631578947, '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}}
Computing the k-Dominant Skyline Efficiently in the Dynamic Environments

Most information these days is being put away in the system, in this manner, there are considerable need of a proficient methodology on finding significant data from the information. One of the advancements called horizon question is being utilized in numerous applications, for example, multi-criteria basic leadership and client inclination inquiries. In any case, as the quantity of measurement increment, the likelihood that a point dominates another point diminishes. Subsequently, there are a great deal of horizon focuses will be recovered in a high dimensional dataset. Consequently, the idea of k-predominant horizons was proposed to manage this issue. In genuine application, information is continued evolving progressively, along these lines a productive methodology on figuring dynamic information is vital required. In this paper, a methodology of keeping up k-prevailing horizon in a powerful domain is proposed. By keeping some data of the first k-prevailing horizons, we can figure the changing horizon efficiently. In addition, a lot of investigations is performed to show the productivity of our methodology.