Proactive Plan-Based Continuous Query Processing over Diverse SPARQL Endpoints

Although the emergence of SPARQL endpoints that allow end-users and applications to query the RDF data they want, continuous processing of building a very large query over diverse SPARQL endpoints requires a sophisticated method. However, current RDF Stream Processing (RSP) applications are limited in terms of scalability and administrative autonomy, due to their tight-coupled data sources (e.g., RDF streams) and being unable to coordinate with existing SPARQL engines. In this paper, we propose a novel continous query processing that is equipped with a proactive adaptation for enhancing a planbased policy, pulling RDF data periodically from remote sources. Our proactive adaptation forecasts the future update pattern of a source, and decides the best action that guarantees the improved data freshness and efficient system workload. We verify the proposed approach in terms of data adaptability, detection latency, and transmission cost in distributed settings.

[1]  Opher Etzion,et al.  A basic model for proactive event-driven computing , 2012, DEBS.

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

[3]  Katja Hose,et al.  FedX: Optimization Techniques for Federated Query Processing on Linked Data , 2011, SEMWEB.

[4]  Daniele Braga,et al.  C-SPARQL: SPARQL for continuous querying , 2009, WWW '09.

[5]  Adrian Paschke,et al.  Plan-Based Semantic Enrichment of Event Streams , 2014, ESWC.

[6]  Kyong-Ho Lee,et al.  Q-ASSF: Query-adaptive semantic stream filtering , 2015, Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015).

[7]  Kyong-Ho Lee,et al.  Spatiotemporal query processing for semantic data stream , 2015, Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015).