EventJava: An Extension of Java for Event Correlation

Eugster, Patrick; Jayaram, K. R.

doi:10.1007/978-3-642-03013-0_26

Cited by 72 publications

(89 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Database-derived systems such as Cayuga [14], Borealis [15] or the commercial StreamBase (www.streambase.org) support all features of CED. EventJava [2] mirrors these at the language level. Several content-based publish/subscribe systems have been extended for generic correlation, such as PADRES [19] which uses Jess [21].…”

Section: State Of the Art Of Cedmentioning

confidence: 95%

“…Then, a. if op is ==, a 2 of all incoming e 2 events are stored in a hash table. Then e 2 .a 2 that equals e 1 .a 1 can be found in constant time (O(1)) by hashing e 1 .a 1 . b. if op is <, <=, >, >=, a 2 of all incoming e 2 events are stored in a B+ tree [22].…”

Section: Correlationmentioning

confidence: 99%

“…Figure 4b shows the event-processing throughput using each strategy. Figure 4b shows that the throughput of GenTrie is 2.5× that of the Jess [21] implementation of the well-known Rete [20] algorithm used by various systems for composite event detection including an earlier incarnation of our own EventJava [2] framework. GenTrie's throughput is also 10× that of Scala Joins and Cω.…”

Section: Stock Monitoringmentioning

confidence: 99%

“…Figure 4f shows that the throughput of GenTrie remains fairly stable over time independently of m -variations in throughput are less than 2%. For an evaluation of the stability of Rete, refer [2].…”

Section: Scalabilitymentioning

confidence: 99%

See 3 more Smart Citations

Scalable Efficient Composite Event Detection

Jayaram

Eugster

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Composite event detection (CED) is the task of identifying combinations of events which are meaningful with respect to programdefined patterns. Recent research in event-based programming has focused on language design (in different paradigms), leading to a wealth of prototype programming models and languages. However, implementing CED in an efficient and scalable manner remains an under-addressed problem. In fact, the lack of scalable algorithms is the main roadblock to incorporating support for more expressive event patterns into prominent event-based programming languages. This lack of scalable algorithms is a particularly acute problem in event stream processing, where event patterns can additionally be specified over time windows. In this paper we describe GenTrie, a deterministic trie-based algorithm for CED. We describe how complex event patterns are split, how each sub-pattern maps to a node in the trie, and demonstrate through empirical evaluation that GenTrie has higher throughput than current implementations of related languages.

show abstract

Section: State Of the Art Of Cedmentioning

confidence: 95%

Section: Correlationmentioning

confidence: 99%

Section: Stock Monitoringmentioning

confidence: 99%

Section: Scalabilitymentioning

confidence: 99%

See 2 more Smart Citations

Scalable Efficient Composite Event Detection

Jayaram

Eugster

2010

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…EventJava [15] allows for powerful expressions in guards, which enables it to build complex relations between asynchronous-only messages. In JErlang, guard conditions can also span over multiple messages, but we are limited by Erlang functionality to disallow new variables or control constructs in them.…”

Section: Related Workmentioning

confidence: 99%

JErlang: Erlang with Joins

Plociniczak¹,

Eisenbach²

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.Erlang is an industrially successful functional language that uses the Actor model for concurrency. It supports the messagepassing paradigm by providing pattern-matching over received messages. Unfortunately coding synchronisation between multiple processes is not straightforward. To overcome this limitation we designed and implemented JErlang, a Join-Calculus inspired extension to Erlang. We provide a rich set of language features with our joins. We present implementation details of our two alternative solutions, a library and an altered VM. Our optimisations provide JErlang with good performance.

show abstract