{'fraction_non_alphanumeric': 0.014192139737991267, 'fraction_numerical': 0.0, 'mean_word_length': 5.072847682119205, '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}}
Parallel strategies for multimedia web services

This paper describes a parallel data structure used to perform multimedia web searches. The Spatial Approximation Tree(SAT) is the data structure selected to index queries, where the complexity measure is given by the number of distance computed to retrieve those objects close enough to the query. We present some parallel methods for load balancing the work performed by the processors. The method can adapt itself to the changes of the workload produced by the user queries. Empirical results with different databases show efficient performance in a real cluster of PC. The multiplexed strategy is the one reporting the lowest number of distance comparisons that is the main performance measure used in this work. Also it reports the mayor gain over the sequential algorithm. The algorithms are designed under the bulk-synchronous model of parallel computing, BSP.