Spatiotemporal RDF Data Query Based on Subgraph Matching

ISPRS International Journal of Geo-Information

Qing Li¹  Lin Zhu²  Xiangfu Meng²  Xiaoyan Zhang² 

[1] School of Computer and Communication Engineering, Northeastern University (Qinhuangdao), Qinhuangdao 066004, China;School of Electronic and Information Engineering, Liaoning Technical University, Huludao 125105, China;

关键词: subgraph matching;    RDF;    spatiotemporal data;    query;   

DOI  :  10.3390/ijgi10120832

来源: DOAJ

【 摘 要 】

Resource Description Framework (RDF), as a standard metadata description framework proposed by the World Wide Web Consortium (W3C), is suitable for modeling and querying Web data. With the growing importance of RDF data in Web data management, there is an increasing need for modeling and querying RDF data. Previous approaches mainly focus on querying RDF. However, a large amount of RDF data have spatial and temporal features. Therefore, it is important to study spatiotemporal RDF data query approaches. In this paper, firstly, we formally define spatiotemporal RDF data, and construct a spatiotemporal RDF model st-RDF that is used to represent and manipulate spatiotemporal RDF data. Secondly, we present a spatiotemporal RDF query algorithm stQuery based on subgraph matching. This algorithm can quickly determine whether the query result is empty for queries whose temporal or spatial range exceeds a specific range by adopting a preliminary query filtering mechanism in the query process. Thirdly, we propose a sorting strategy that calculates the matching order of query nodes to speed up the subgraph matching. Finally, we conduct experiments in terms of effect and query efficiency. The experimental results show the performance advantages of our approach.

【 授权许可】

Unknown