Hostname: page-component-6766d58669-bp2c4 Total loading time: 0 Render date: 2026-05-24T10:35:55.098Z Has data issue: false hasContentIssue false

A Distributed Approach to LARS Stream Reasoning (System paper)

Published online by Cambridge University Press:  20 September 2019

THOMAS EITER
Affiliation:
Technische Universität Wien, Institut für Logic and Computation, KBS Group (e-mail: eiter@kr.tuwien.ac.at)
PAUL OGRIS
Affiliation:
Alpen-Adria-Universität, Klagenfurt, Austria (e-mail: konstantin.schekotihin@aau.at, paul.ogris@aau.at)
KONSTANTIN SCHEKOTIHIN
Affiliation:
Alpen-Adria-Universität, Klagenfurt, Austria (e-mail: konstantin.schekotihin@aau.at, paul.ogris@aau.at)

Abstract

Stream reasoning systems are designed for complex decision-making from possibly infinite, dynamic streams of data. Modern approaches to stream reasoning are usually performing their computations using stand-alone solvers, which incrementally update their internal state and return results as the new portions of data streams are pushed. However, the performance of such approaches degrades quickly as the rates of the input data and the complexity of decision problems are growing. This problem was already recognized in the area of stream processing, where systems became distributed in order to allocate vast computing resources provided by clouds. In this paper we propose a distributed approach to stream reasoning that can efficiently split computations among different solvers communicating their results over data streams. Moreover, in order to increase the throughput of the distributed system, we suggest an interval-based semantics for the LARS language, which enables significant reductions of network traffic. Performed evaluations indicate that the distributed stream reasoning significantly outperforms existing stand-alone LARS solvers when the complexity of decision problems and the rate of incoming data are increasing.

Information

Type
Original Article
Copyright
© Cambridge University Press 2019 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable