Pattern match query over fuzzy RDF graph

摘要

In real applications, there are many domains that are full of uncertainty. As the resource description language of the Semantic Web, vagueness RDF data are playing an increasingly important role. And efficient querying of fuzzy RDF data is therefore of increasing importance. In this paper, we firstly introduce practical extensions of the RDF model to represent vagueness based on the fuzzy graph. Then we study the problem of querying subgraph from fuzzy RDF graph that matches with a given pattern graph with high satisfaction degree. The graph pattern surpasses previous proposals in terms of expressiveness because it can use regular expressions to specify the structural conditions of the graph in addition to the fuzzy conditions on the vertex values. We further develop an algorithm for evaluating graph pattern queries based on a revised notion of graph homomorphism. Finally, we verified the effectiveness, efficiency, and scalability of the algorithm using a comprehensive experimental evaluation of real-life data and synthetic data.