{'fraction_non_alphanumeric': 0.01739788199697428, 'fraction_numerical': 0.0, 'mean_word_length': 5.182242990654205, '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}}
BSP-Based Strongly Connected Component Algorithm in Joint Cloud Computing

There is a trend that many applications are deployed among multiple public or private clouds. Due to the data asset protection and network communication cost, it is not feasible to gather all the data from different clouds to a single cloud. Inter-cloud graph data mining is becoming a new challenge. The strongly connected component algorithm is a basic graph algorithm that plays an important role in many important areas such as social network analysis, web search and even biomedical areas. However, only few distributed processing frameworks provide this algorithm, which is currently unavailable in joint cloud computing frameworks. To this end, this paper proposes a BSP (Bulk Synchronous Parallel) service over joint cloud computing and a BSP-based strongly connected component algorithm which can be easily realized on any distributed platform as long as it provides BSP service. Many graph algorithms can be easily developed in the cross-cloud computation environment by using this BSP service. Moreover, this BSP-based strongly connected component algorithm not only fills the gaps in the domain of distributed graph processing frameworks, but also extends its scalability to the level of cross-cloud computing by using the BSP service.