Moving real-time linked data query evaluation to the client

Traditional RDF stream processing engines work completely server-side, which contributes to a high server cost. For allowing a large number of concurrent clients to do continuous querying, we extend the low-cost Triple Pattern Fragments (TPF) interface with support for timesensitive queries. In this poster, we give the overview of a client-side rdf stream processing engine on top of tpf. Our experiments show that our solution significantly lowers the server load while increasing the load on the clients. Preliminary results indicate that our solution moves the complexity of continuously evaluating real-time queries from the server to the client, which makes real-time querying much more scalable for a large amount of concurrent clients when compared to the alternatives

Is Context-aware Reasoning = Case-based Reasoning?

The purpose of this paper is to explore the similarities and differences and then argue for the potential synergies between two methodologies, namely Context-aware Reasoning and Case-based Reasoning, that are amongst the tools which can be used for intelligent environment (IE) system development. Through a case study supported by a review of the literature, we argue that context awareness and case based reasoning are not equal and are complementary methodologies to solve a domain specific problem, rather, the IE development paradigm must build a cooperation between these two approaches to overcome the individual drawbacks and to maximise the success of the IE systems

Is Context-aware Reasoning = Case-based Reasoning?

The purpose of this paper is to explore the similarities and differences and then argue for the potential synergies between two methodologies, namely Context-aware Reasoning and Case-based Reasoning, that are amongst the tools which can be used for intelligent environment (IE) system development. Through a case study supported by a review of the literature, we argue that context awareness and case based reasoning are not equal and are complementary methodologies to solve a domain specific problem, rather, the IE development paradigm must build a cooperation between these two approaches to overcome the individual drawbacks and to maximise the success of the IE systems

Efficient State Update Exchange in a CPS Environment for Linked Data-based Digital Twins

International audienceThis paper addresses the problem of reducing the number of messages needed to exchange state updates between the Cyber-Physical System (CPS) components that integrate with the rest of the CPS through Digital Twins in order to maintain uniform communication interface and carry out their tasks correctly and safely. The main contribution is a proposed architecture and the discussion of its suitability to support correct execution of complex tasks across the CPS. A new State Event Filtering component is presented to provide event-based communication among Digital Twins that are based on the Linked Data principles while keeping the fan-out limited to ensure the scalability of the architecture

Knowledge Extraction Using Probabilistic Reasoning: An Artificial Neural Network Approach

The World Wide Web (WWW) has radically changed the way in which we access, generate and disseminate information. Its presence is felt daily and with more internet-enabled devices being connected the web of knowledge is growing. We are now moving into era where the WWW is capable of ‘understanding’ the actual/intended meaning of our content. This is being achieved by creating links between distributed data sources using the Resource Description Framework (RDF). In order to find information in this web of interconnected sources, complex query languages are often employed, e.g. SPARQL. However, this approach is limited as exact query matches are often required. In order to overcome this challenge, this paper presents a probabilistic approach to searching RDF documents. The developed algorithm converts RDF data into a matrix of features and treats searching as a machine learning problem. Using a number of artificial neural network algorithms, a successfully developed prototype has been developed that demonstrates the applicability of the approach. The results illustrate that the Voted Perceptron classifier (VPC), perceptron linear classifier (PERLC) and random neural network classifier (RNNC) performed particularly well, with accuracies of 100%, 98% and 93% respectively

PLAY: Semantics-based Event Marketplace

International audienceIn this paper we present PLAY Platform, a Web-oriented distributed semantic middleware that serves as an Event M arketplace: the place where heterogeneous events can be integrated and combined. The purpose of the platform is to derive useful information from diverse real-time sources such as collaborative processes. The platform provides technology where instant results are needed or where heterogeneous data must be integrated on the fly or where the data arrive fast enough to require the stream processing nature of our approach. The main advantages of the platforms are its scalability (cloud-based nature) and the expressivity of the event combinations that can be defined (using both real-time and historical data). The platform has been applied in a use case about Personal data management. In this paper we present some results from the validation, focusing on smartphone and social media integration

Continuously Updating Query Results over Real-Time Linked Data

Abstract. Existing solutions to query dynamic Linked Data sources extend the language, and require continuous server processing for each query. Traditional endpoints accept highly expressive queries, contributing to high server cost. Extending these endpoints for time-sensitive queries increases the server cost even further. To make continuous querying over real-time Linked Data more affordable, we extend the low-cost Triple Pattern Fragments ( ) interface with support for time-sensitive queries. In this paper, we discuss a framework on top of that allows clients to execute queries with continuously updating results. Our experiments indicate that this extension significantly lowers the server complexity. The trade-off is an increase in the execution time per query. We prove that by moving the complexity of continuously evaluating real-time queries over Linked Data to the clients and thus increasing the bandwidth usage, the cost of server-side interfaces is significantly reduced. Our results show that this solution makes real-time querying more scalable in terms of usage for a large amount of concurrent clients when compared to the alternatives

SRBench: A streaming RDF/SPARQL benchmark

We introduce SRBench, a general-purpose benchmark primarily designed for streaming RDF/SPARQL engines, completely based on real-world data sets from the Linked Open Data cloud. With the increasing problem of too much streaming data but not enough tools to gain knowledge from them, researchers have set out for solutions in which Semantic Web technologies are adapted and extended for publishing, sharing, analysing and understanding streaming data. To help researchers and users comparing streaming RDF/SPARQL (strRS) engines in a standardised application scenario, we have designed SRBench, with which one can assess the abilities of a strRS engine to cope with a broad range of use cases typically encountered in real-world scenarios. The data sets used in the benchmark have been carefully chosen, such that they represent a realistic and relevant usage of streaming data. The benchmark defines a concise, yet omprehensive set of queries that cover the major aspects of strRS processing. Finally, our work is complemented with a functional evaluation on three representative strRS engines: SPARQLStream, C-SPARQL and CQELS. The presented results are meant to give a first baseline and illustrate the state-of-the-art