SPARQL-Based Applications for RDF-Encoded Sensor Data

Complex event processing is currently more dominated by proprietary systems and vertical products than open technologies. In the future, however, internet-connected people and things moving between smart spaces in smart cities will create a huge volume of events in a multi-actor, multi-platform environment. End-user applications would benefit from the possibility for open access to all relevant sensors and data sources. The work on semantic sensor networks concerns such open technologies to discover and access sensors on the Web, to integrate heterogeneous sensor data, and to make it meaningful to applications. In this study we address the question of how a set of applications can efficiently access a shared set of sensors while avoiding redundant data acquisition that would lead to energy-efficiency problems. The Instans event processing platform, based on the Rete-algorithm, offers continuous execution of interconnected SPARQL queries and update rules. Rete enables sharing of sensor access and caching of intermediate results in a natural and high-performance manner. Our solution suggests that with incremental query evaluation, standard-based SPARQL and RDF can handle complex event processing tasks relevant to sensor networks, and reduce the redundant access from a set of applications to shared sensors.

[1]  Oscar Corcho,et al.  Semantic Sensor Network XG Final Report , 2011 .

[2]  Christoph Stasch,et al.  New Generation Sensor Web Enablement , 2011, Sensors.

[3]  Charles L. Forgy,et al.  Rete: a fast algorithm for the many pattern/many object pattern match problem , 1991 .

[4]  Daniele Braga,et al.  An execution environment for C-SPARQL queries , 2010, EDBT '10.

[5]  Daniele Braga,et al.  C-SPARQL: a Continuous Query Language for RDF Data Streams , 2010, Int. J. Semantic Comput..

[6]  Opher Etzion,et al.  Event Processing in Action , 2010 .

[7]  Haris Abdullah,et al.  Processing Heterogeneous RDF Events with Standing SPARQL Update Rules , 2012, OTM Conferences.

[8]  Daniel P. Miranker TREAT: A new and efficient match algorithm for AI production systems , 1988 .

[9]  Abdelsalam Helal,et al.  Optimizing push/pull envelopes for energy-efficient cloud-sensor systems , 2011, MSWiM '11.

[10]  Sebastian Rudolph,et al.  EP-SPARQL: a unified language for event processing and stream reasoning , 2011, WWW.

[11]  Charles Lanny Forgy,et al.  On the efficient implementation of production systems. , 1979 .

[12]  Kamesh Munagala,et al.  Suppression and failures in sensor networks: a Bayesian approach , 2007, VLDB 2007.

[13]  Haris Abdullah,et al.  Efficient matching of SPARQL subscriptions using rete , 2012, SAC '12.

[14]  Daniele Braga,et al.  Querying RDF streams with C-SPARQL , 2010, SGMD.

[15]  David Corsar,et al.  Semantic Sensor Networks 2011 , 2011 .

[16]  Daniel P. Miranker TREAT: a better match algorithm for AI production systems , 1987, AAAI 1987.

[17]  Danh Le Phuoc,et al.  A Native and Adaptive Approach for Unified Processing of Linked Streams and Linked Data , 2011, SEMWEB.

[18]  Óscar Corcho,et al.  Five challenges for the Semantic Sensor Web , 2010, Semantic Web.