{'fraction_non_alphanumeric': 0.017873941674506115, 'fraction_numerical': 0.0037629350893697085, 'mean_word_length': 5.409638554216867, '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}}
Constrained Skyline Computing over Data Streams

Skyline computing has become a hot topic in the International since 2001. In data stream environment, previous works about Skyline computing only sought to maintain full space Skyline points or compute subspace Skyline points over sliding window. No one has considered the problem of computing constrained Skyline points over sliding window. For many real-word applications, however, users usually expect to receive constrained Skyline points quickly or progressively. In this paper, we study constrained Skyline computing over data streams. To the best of our knowledge, this problem has not been addressed before. The existing algorithms and their variations cannot be easily extended to support constrained Skyline computing efficiently, so a novel algorithm, called CSC, is proposed in this paper to solve this problem. It is a well progressive algorithm to incrementally maintain all the non-redundant dominance relationships of tuples over sliding window, and then compute all the constrained Skyline points.