The delay and window size problems in rule-based stream reasoning
In recent years, there has been an increasing interest in extending stream processing engines with rule-based temporal reasoning capabilities. To ensure correctness, such systems must be able to output results over the partial data received so far as if the entire (infinite) stream had been availabl...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
Elsevier
2022
|
| _version_ | 1797108694436020224 |
|---|---|
| author | Ronca, A Kaminski, M Grau, BC Horrocks, I |
| author_facet | Ronca, A Kaminski, M Grau, BC Horrocks, I |
| author_sort | Ronca, A |
| collection | OXFORD |
| description | In recent years, there has been an increasing interest in extending stream processing engines with rule-based temporal reasoning capabilities. To ensure correctness, such systems must be able to output results over the partial data received so far as if the entire (infinite) stream had been available; furthermore, these results must be streamed out as soon as the relevant data is received, thus incurring the minimum possible delay; finally, due to memory limitations, systems can only keep a limited history of previous facts in memory to perform further computations. These requirements pose significant theoretical and practical challenges since temporal rules can derive new information and propagate it both towards past and future time points; as a result, streamed answers can depend on data that has not yet been received, as well as on data that arrived far in the past. Towards developing a solid foundation for practical rule-based stream reasoning, we propose and study in this paper a suite of decision problems that can be exploited by stream reasoning algorithms to tackle the aforementioned challenges, and provide tight complexity bounds for a core temporal extension of Datalog. All of the problems we consider can be solved at design time (under reasonable assumptions), prior to the processing of any data. Solving these problems enables the use of reasoning algorithms that process the input streams incrementally using a sliding window, while at the same time supporting an expressive rule-based knowledge representation language and minimising both latency and memory consumption. |
| first_indexed | 2024-03-07T07:32:15Z |
| format | Journal article |
| id | oxford-uuid:a22b6726-1755-4725-a86f-46ea03de7c36 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T07:32:15Z |
| publishDate | 2022 |
| publisher | Elsevier |
| record_format | dspace |
| spelling | oxford-uuid:a22b6726-1755-4725-a86f-46ea03de7c362023-01-31T09:07:40ZThe delay and window size problems in rule-based stream reasoningJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:a22b6726-1755-4725-a86f-46ea03de7c36EnglishSymplectic ElementsElsevier2022Ronca, AKaminski, MGrau, BCHorrocks, IIn recent years, there has been an increasing interest in extending stream processing engines with rule-based temporal reasoning capabilities. To ensure correctness, such systems must be able to output results over the partial data received so far as if the entire (infinite) stream had been available; furthermore, these results must be streamed out as soon as the relevant data is received, thus incurring the minimum possible delay; finally, due to memory limitations, systems can only keep a limited history of previous facts in memory to perform further computations. These requirements pose significant theoretical and practical challenges since temporal rules can derive new information and propagate it both towards past and future time points; as a result, streamed answers can depend on data that has not yet been received, as well as on data that arrived far in the past. Towards developing a solid foundation for practical rule-based stream reasoning, we propose and study in this paper a suite of decision problems that can be exploited by stream reasoning algorithms to tackle the aforementioned challenges, and provide tight complexity bounds for a core temporal extension of Datalog. All of the problems we consider can be solved at design time (under reasonable assumptions), prior to the processing of any data. Solving these problems enables the use of reasoning algorithms that process the input streams incrementally using a sliding window, while at the same time supporting an expressive rule-based knowledge representation language and minimising both latency and memory consumption. |
| spellingShingle | Ronca, A Kaminski, M Grau, BC Horrocks, I The delay and window size problems in rule-based stream reasoning |
| title | The delay and window size problems in rule-based stream reasoning |
| title_full | The delay and window size problems in rule-based stream reasoning |
| title_fullStr | The delay and window size problems in rule-based stream reasoning |
| title_full_unstemmed | The delay and window size problems in rule-based stream reasoning |
| title_short | The delay and window size problems in rule-based stream reasoning |
| title_sort | delay and window size problems in rule based stream reasoning |
| work_keys_str_mv | AT roncaa thedelayandwindowsizeproblemsinrulebasedstreamreasoning AT kaminskim thedelayandwindowsizeproblemsinrulebasedstreamreasoning AT graubc thedelayandwindowsizeproblemsinrulebasedstreamreasoning AT horrocksi thedelayandwindowsizeproblemsinrulebasedstreamreasoning AT roncaa delayandwindowsizeproblemsinrulebasedstreamreasoning AT kaminskim delayandwindowsizeproblemsinrulebasedstreamreasoning AT graubc delayandwindowsizeproblemsinrulebasedstreamreasoning AT horrocksi delayandwindowsizeproblemsinrulebasedstreamreasoning |