{'fraction_non_alphanumeric': 0.019801980198019802, 'fraction_numerical': 0.0, 'mean_word_length': 5.316964285714286, '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}}
MRFSG-IG: MapReduce based Frequent Subgraph Mining using Integrated Graph Index

In a distributed environment, as the graph databases emerge from multiple sources, the graph database's size increases rapidly, resulting in a massive database. Mining frequent subgraphs is a fundamental problem for graph clustering, classification, and subgraph association rule mining. Nevertheless, extracting frequent subgraphs from an extensive graph database is complex work. Existing works for frequent mining subgraphs assume that the large graph database is stored on a single system. This assumption is not correct in all cases. This paper designs a novel algorithm in which frequent subgraph mining takes advantage of partitioning and graph indexing. We follow three necessary steps: graph partitioning, graph indexing, and frequent subgraph mining. We used structure-based graph partitioning for frequent subgraph mining. We use Integrated Graph Index as a vertical format of graphs in the case of frequent itemset mining. Integrated Graph Index has low maintenance costs, and it provides an easy way to add graphs in the massive graph database. We complete frequent mining subgraphs in a single Map-Reduce round. This approach is suitable for incremental mining of frequent subgraphs from the large graph database. We proved that this technique reduces running time to find frequent subgraphs over large graph databases.