Querying Composite Events for Reactivity on the Web

Bry, François; Eckert, Michael; Pătrânjan, Paula-Lavinia

doi:10.1007/11610496_5

Cited by 12 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The theses reflect our experiences from designing the reactive language XChange [4,18,3,19] and programming in it. An initial design and a prototype implementation of XChange are complete, and we hope for the positions presented in this paper to provide directions in the future development of XChange.…”

Section: Resultsmentioning

confidence: 62%

Twelve Theses on Reactive Rules for the Web

Bry¹,

Eckert²

2006

Current Trends in Database Technology – EDBT 2006

Self Cite

View full text Add to dashboard Cite

Abstract. Reactivity, the ability to detect and react to events, is an essential functionality in many information systems. In particular, Web systems such as online marketplaces, adaptive (e.g., recommender) systems, and Web services, react to events such as Web page updates or data posted to a server. This article investigates issues of relevance in designing high-level programming languages dedicated to reactivity on the Web. It presents twelve theses on features desirable for a language of reactive rules tuned to programming Web and Semantic Web applications.

show abstract

Section: Resultsmentioning

confidence: 62%

Twelve Theses on Reactive Rules for the Web

Bry¹,

Eckert²

2006

Current Trends in Database Technology – EDBT 2006

Self Cite

View full text Add to dashboard Cite

show abstract

“…Outside of transactions, however, bounds on the "life-spans" of events and garbage collection become important [10]. Some event algebras therefore allow to add a temporal window to an operator or a subexpression (e.g., [22,19,11,9]), e.g., (A; B) 1h to indicate that B must follow A within 1 hour. The lifespans of [2] are also similar to this.…”

Section: Related Workmentioning

confidence: 99%

On static determination of temporal relevance for incremental evaluation of complex event queries

Bry

Eckert

2008

Proceedings of the Second International Conference on Distributed Event-Based Systems

Self Cite

View full text Add to dashboard Cite

Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period of time for which an event or an intermediate result must (at least) be stored its temporal relevance. This paper pioneers a precise definition of temporal relevance and develops a method for statically (i.e., at compile time) determining it. During query evaluation (i.e., at run time), this enables garbage collection of events that become irrelevant as time progresses. Temporal relevance is also important at compile time for cost-based query planning.

show abstract

“…For this, XChange supports composite event queries [3], which are built by combining event queries with composition operators like andthen (ordered sequence of events), and (unordered conjunction of events), or without (absence of events) and temporal restrictions like within (all events happen within a given length of time).…”

Section: Event Queriesmentioning

confidence: 99%