A parameterized algebra for event notification services

Hinze, Annika; Voisard, Agnès

doi:10.1109/time.2002.1027476

Cited by 26 publications

(26 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Event algebras and active databases [40][41][42] represent another relevant research area with connections to the alarm model. Event algebras define temporal patterns of discrete events to form composite events.…”

Section: Related Workmentioning

confidence: 99%

Chasing a Definition of “Alarm”

Wallin

2009

J Netw Syst Manage

View full text Add to dashboard Cite

Alarm management has been around for decades in telecom solutions. We have seen various efforts to define standardised alarm interfaces. The research community has focused on various alarms correlation strategies. Still, after years of effort in industry and research alike, network administrators are flooded with alarms; alarms are suffering from poor information quality; and the costs of alarm integration have not decreased. In this paper, we explore the concept of 'alarm'. We define 'alarm' and alarm-type concepts by investigating the different definitions currently in use in standards and research efforts. Based on statistical alarm data from a mobile operator we argue that operational and capital expenditures would decrease if alarm sources would apply to our alarm model.

show abstract

Section: Related Workmentioning

confidence: 99%

Chasing a Definition of “Alarm”

Wallin

2009

J Netw Syst Manage

View full text Add to dashboard Cite

show abstract

“…Another form of event-based application-independent infrastructures can be found with Event-Notification-Services (ENS) and Publish-Subscribe systems [CRW01,HV02]. Generators of events publish event notifications to the infrastructure whereas consumers of events subscribe with the infrastructure to receive relevant notifications.…”

Section: Related Work Event-driven Architecturesmentioning

confidence: 99%

An Active Domain Node Architecture for the Semantic Web

Schenk

May

2009

On the Move to Meaningful Internet Systems: OTM 2009

View full text Add to dashboard Cite

The scope of this work is knowledge management in the Semantic Web. Its contribution is the design, development, and characterisation of an application node architecture for the Semantic Web, called Swan. The core of the Swan architecture consists of an OWL knowledge base which is supplemented by a hybrid reasoning mechanism. Hybrid reasoning in Swan combines F-Logic and Description Logic reasoning. Update operations for the manipulation of the knowledge base are provided with a well-defined semantics. Intensional updates are possible and allow to define updates with respect to implicit knowledge. A unique trigger mechanism is used for the completion of intensional updates, but also for the maintenance of knowledge base integrity. By its ability to process abstract action definitions, the application node can be integrated directly into the event-driven Semantic Web architecture Mars. A protoype of this architecture has been implemented, which shows the flexibility and applicability of its concepts. Keywords:Semantic Web, Event-Driven Architecture, OWL, Active Knowledge Base, Intensional Updates, Hybrid Reasoning, Description Logic, FLogic. ContentsAbstract 3

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

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

A parameterized algebra for event notification services

Cited by 26 publications

References 9 publications

Chasing a Definition of “Alarm”

Chasing a Definition of “Alarm”

An Active Domain Node Architecture for the Semantic Web

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

Contact Info

Product

Resources

About