Advanced Search
CS Search Google Search
Subscribers, please login

Published Articles >> Table of Contents >> Abstract

22nd International Conference on Distributed Computing Systems Workshops (ICDCSW '02)   p. 525
Efficient Distribution-Based Event Filtering

Full Article Text: Download PDF of full textBuy this articleGet full text from IEEE Xplore

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDCSW.2002.1030821
Send link to a friend

Abstract
Event notification services are used in various applications, for example, stock tickers, environmental monitoring, and facility management. Several filtering algorithms for such services have been proposed. The best performance results are achieved by tree-based algorithms. However, to our knowledge existing algorithms do not consider the influence of event and profile distribution on the filter performance. In this paper we propose a distribution-dependent improvement of the tree-algorithm. We present the test results of our prototypical implementation that show the influence of various distribution-based measures on the performance.
Additional Information

Citation:  Annika Hinze, Sven Bittner, "Efficient Distribution-Based Event Filtering," icdcsw, p. 525,  22nd International Conference on Distributed Computing Systems Workshops (ICDCSW '02),  2002

Similar Articles

Abstract Contents
Abstract
Citation




Free access to

  • Abstracts
  • Selected PDFs

Electronic subscribers login to:

  • Access HTML/PDFs of full text articles

Subscription information

Get a Web account

PDFs require Adobe Acrobat Reader.

Peer Review Notice

Give us Feedback