{'fraction_non_alphanumeric': 0.01673228346456693, 'fraction_numerical': 0.0, 'mean_word_length': 4.878612716763006, '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}}
Distributed Aggregation Strategies for Preference Queries

Networks of cooperating peers are a new exciting paradigm for evaluating queries in a distributed environment. In this scenario, a query originated at a peer propagates through the network, and the overall result is obtained by aggregating those returned by the peers involved in the evaluation. In this paper we consider the relevant case of preference queries, in which the user is interested in obtaining all and only the “best” results. We highlight the fundamental difference between queries in which preferences define a weak order (wo) over objects and the more general ones for which a strict partial order (spo) has to be considered. While for wo queries a simple algorithm that minimizes the overall number of objects to be transmitted across the network can be easily derived, we show that this is not the case for spo queries. Then, we detail a set of basic issues whose solution is a key to the derivation of an efficient distributed algorithm.