{'fraction_non_alphanumeric': 0.020454545454545454, 'fraction_numerical': 0.0, 'mean_word_length': 4.873333333333333, '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}}
Flexible Querying in Linked Data Sources

Querying Linked Data Sources is a hard process for users who are not aware of data sources contents and thus cannot formulate their queries on these sources. In this context, our goal is to present a flexible approach to query linked data sources giving users the feeling that they manipulate a single data source with the possibility (i) to add or discard data sources more easily than existing approaches in the domain of data integration, and (ii) to submit queries over a global schema (i.e. domain ontology) without worrying about vocabularies or physical constraints such as how to access data sources (endpoints) or how many links exist between these data sources, etc. In this paper, we start by presenting this approach, then we discuss the primary components of the corresponding mediator and we focus on the matching component.