download0 view143
twitter facebook

공공누리This item is licensed Korea Open Government License

Title
Distributed and Parallel Path Query Processing for Semantic Sensor Networks
Author(s)
정성재정한민김환민서동민이승우
Publication Year
2014-01-09
Abstract
As the sensor networks are broadly used in diverse range of applications, Semantic Web technologies have been adopted as a means to manage the huge amount of heterogeneous sensor nodes and their observation data. Large amount of sensor data are annotated with spatial, temporal, and thematic semantic metadata. As a consequence, efficient query processing over large RDF graph is becoming more important in retrieving contextual information from semantic sensor data. In this paper we propose a novel path querying scheme which uses RDF schema information. By utilizing the class path expressions precalculated from RDF schema, the graph search space is significantly reduced. Compared with the conventional BFS algorithm, the proposed algorithm (bidirectional BFS combined with class path lookup approach) achieves performance improvement by 3 orders of magnitude. Additionally, we show that the proposed algorithm is efficiently parallelizable, and thus, the proposed algorithm returns graph search results within a reasonable response time on even much larger RDF graph.
Keyword
Semantic Web; RDF Graph; RDF Schema; Path Querying
Journal Title
International journal of distributed sensor networks
ISSN
1550-1329
Files in This Item:
There are no files associated with this item.
Appears in Collections:
7. KISTI 연구성과 > 학술지 발표논문
URI
https://repository.kisti.re.kr/handle/10580/14371
http://www.ndsl.kr/ndsl/search/detail/article/articleSearchResultDetail.do?cn=NART79991874
Export
RIS (EndNote)
XLS (Excel)
XML

Browse