SnoopIB: Interval-Based Event Specification and Detection for Active Databases

Adaikkalavan, Raman; Chakravarthy, Sharma

doi:10.1007/978-3-540-39403-7_16

Cited by 28 publications

(25 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The composite event definition languages of SNOOP [9,3] and ODE [16] are important representatives of this class. Both systems describe composite events in a formalism related to regular expressions, allowing events to be recognized using a nondeterministic finite automaton model.…”

Section: Related Workmentioning

confidence: 99%

Towards Expressive Publish/Subscribe Systems

Demers

Gehrke

Hong

et al. 2006

Lecture Notes in Computer Science

195

193

View full text Add to dashboard Cite

Abstract. Traditional content based publish/subscribe (pub/sub) systems allow users to express stateless subscriptions evaluated on individual events. However, many applications such as monitoring RSS streams, stock tickers, or management of RFID data streams require the ability to handle stateful subscriptions. In this paper, we introduce Cayuga, a stateful pub/sub system based on nondeterministic finite state automata (NFA). Cayuga allows users to express subscriptions that span multiple events, and it supports powerful language features such as parameterization and aggregation, which significantly extend the expressive power of standard pub/sub systems. Based on a set of formally defined language operators, the subscription language of Cayuga provides non-ambiguous subscription semantics as well as unique opportunities for optimizations. We experimentally demonstrate that common optimization techniques used in NFA-based systems such as state merging have only limited effectiveness, and we propose novel efficient indexing methods to speed up subscription processing. In a thorough experimental evaluation we show the efficacy of our approach.

show abstract

Section: Related Workmentioning

confidence: 99%

Towards Expressive Publish/Subscribe Systems

Demers

Gehrke

Hong

et al. 2006

Lecture Notes in Computer Science

195

193

View full text Add to dashboard Cite

show abstract

“…Many event algebras do not have temporal restrictions that would allow garbage collection through temporal relevance (e.g., [17,16,12,1]). In part, this is due to the fact that event queries in these works are assumed to run inside (short-lived) database transactions.…”

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

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

“…The key problem of event-driven mechanism is to combine some simple events and extract the complex events [2]. Based on the logical and temporal relation between atomic events, five kinds of operations are defined in paper [3]. Gao Jing [4] analyzes the composition events from three kinds of data, which are time, space and data.…”

Section: Introductionmentioning

confidence: 99%

Fuzzy Concept Lattice Based Event Composition Model

YIN¹,

CHU²

2017

dtetr

View full text Add to dashboard Cite

Abstract. Because of the existence of uncertainty in physical word, the classical theory-based event model cannot express the change of state accurately. This paper builds a fuzzy concept lattice-based temporal-spatial event composition model to describe events correctly and combine events efficiently. We define fuzzy event concept and formal representation of event instance, and prove the theorems of event type and attribute composition on basis of fuzzy concept lattice. Moreover, we analyze event composition rules from three aspects which are temporal, spatial and internal attributes. Finally, by applying the fuzzy event composition model to smart space and comparing it with Tan's model, the proposed event model in this paper is characterized with variable membership threshold, attributed temporal-spatial relationship, and supporting component coordination.

show abstract

SnoopIB: Interval-Based Event Specification and Detection for Active Databases

Cited by 28 publications

References 12 publications

Towards Expressive Publish/Subscribe Systems

Towards Expressive Publish/Subscribe Systems

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

Fuzzy Concept Lattice Based Event Composition Model

Contact Info

Product

Resources

About