Approximate Matching of Spatiotemporal RDF Data by Path

Due to an ever-increasing number of RDF data with time features and space features, it is an important task to query efficiently spatiotemporal RDF data over RDF datasets. In this paper, the spatiotemporal RDF data contains time features, space features and text features, which are processed separately to facilitate query. Meanwhile the decomposition graph algorithm and the combination query paths algorithm are designed. The query graph with spatiotemporal features is split into multiple paths, and then every path in the query graph is used to search for the best matching path in the path sets contained in the data graph. Due to the existence of inaccurate matchings, approximate matchings are performed according to the evaluation function to find the best matching path. Finally, all the best paths are combined to generate a matching result graph. Our approach is evaluated from approximate performances and query performances. The experimental results show that the effectiveness and efficiency of our method