Approximate Continuous Query Answering over Streams and Dynamic Linked Data Sets

To perform complex tasks, RDF Stream Processing Web applications evaluate continuous queries over streams and quasi-static background data. While the former are pushed in the application, the latter are continuously retrieved from the sources. As soon as the background data increase the volume and become distributed over the Web, the cost to retrieve them increases and applications become unresponsive. In this paper, we address the problem of optimizing the evaluation of these queries by leveraging local views on background data. Local views enhance performance, but require maintenance processes, because changes in the background data sources are not automatically reflected in the application. We propose a two-step query-driven maintenance process to maintain the local view: it exploits information from the query e.g.,i¾źthe sliding window definition and the current window content to maintain the local view based on user-defined Quality of Service constraints. Experimental evaluation show the effectiveness of the approach.