Path-based approximate matching of fuzzy spatiotemporal RDF data

As fuzzy spatiotemporal information continuously increases in RDF database, it is challenging to model and query fuzzy spatiotemporal RDF data efficiently and effectively. However, various researches are studied in temporal RDF database, spatial RDF database, and spatiotemporal RDF database. Querying fuzzy spatiotemporal RDF data has received relatively little attention, especially approximate matching of fuzzy spatiotemporal RDF data. To accomplish this, we first study fuzzy spatiotemporal RDF data graph, spatiotemporal RDF query graph, and path of fuzzy spatiotemporal RDF data graph. Then, we propose a scoring function for approximate evaluation of fuzzy spatiotemporal RDF data graph and spatiotemporal RDF query graph. After dividing the fuzzy spatiotemporal RDF data graphs into five categories based on their structure, we propose the decomposition algorithm, matching algorithm, and combination algorithm for approximate matching of fuzzy spatiotemporal RDF data. Our approach adopts path-based matching so that it is easy to discover the relations between two vertices in fuzzy spatiotemporal RDF data graph. Finally, the experimental results demonstrate the performance advantages of our approach.