{'fraction_non_alphanumeric': 0.010604453870625663, 'fraction_numerical': 0.0, 'mean_word_length': 5.090322580645161, '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}}
Hybrid Index Structure based on MBB Approximation for Linked Data

Although a pragmatic approach towards achieving Semantic Web has gained some traction with Linked Data, there are still a lot of open problems in the area of Linked Data. Because Linked Data are modeled as RDF graphs, we cannot directly adopt existing solutions from database systems or Web technologies. This paper presents a hybrid method between the centralized approach and the distributed approach based on query processing to increase the join query performance. Using auxiliary indexes we can retrieve distributed data resources participating on a query result, rapidly reducing the amount of data that are really needed to be accessed on-demand. The performance of the proposed index structure is compared with some existing methods on a real RDF dataset. Our method outperforms the existing methods due to its ability to reduce a large amount of irrelevant resources.