Font Size: a A A

A Temporal Query Mechanism For Linked Stream Data

Posted on:2018-12-23Degree:MasterType:Thesis
Country:ChinaCandidate:J ChuFull Text:PDF
GTID:2428330605952368Subject:Software engineering
Abstract/Summary:PDF Full Text Request
The increasing popularity of Linked Data Streams has led to the developments of several RDF stream processing engines.Among them,CQELS uses a “white-box” technology and achieves an adaptive query execution mechanism,which gives it a performance advantage over other engines.In the traditional Complex Event Processing,temporal logics between events have a wide range of applications in the financial securities,traffic control,security control,health and other fields.However,existing RDF stream processing provides insufficient support for temporal logics and complex event processing.To address the problem above,the paper extends CQELS query language and semantics to enrich CQELS with temporal logics and complex event processing.This paper align CQELS with the three dimensions of the complex event processing semantics and meet the requirements of complex event processing.The problem of incremental execution,time storage,expiration of cached results,sequence operation encountered in the implementation process is solved.Implementation extends expressiveness of CQELS language and realizes complex event processing over linked data streams.Moreover,this paper experimentally verifies the expansion of CQELS and gives a detailed analysis.Finally,this paper compares the performance of the extended CQELS engine with the original CQELS engine.This paper evaluates two RSP engines with respect to latency and memory.As a result of the experiment,the extended CQELS is reduced by 30% on latency,but at the expense of memory usage,about 4% increased memory usage.This paper also designs an experiment to test the maximum throughput of 23640 triple/s.
Keywords/Search Tags:Linked Stream Data Processing, Complex Event, CQELS, Temporal Logics
PDF Full Text Request
Related items