Show simple item record  

dc.contributor.authorBittner, Sven
dc.contributor.authorHinze, Annika
dc.coverage.spatialConference held at Cyprusen_NZ
dc.identifier.citationHinze, A. & Bittner, S.(2005). A detailed investigation of memory requirements for publish/subscribe filtering algorithms. In Proceedings of the OTM Confederated International Workshops and Posters, AWeSOMe, CAMS, GADA, MIOS+INTEROP, ORM, PhDS, SeBGIS, SWWS, and WOSE 2005, Agia Napa, Cyprus, October 31 - November 4, 2005(pp. 148-165). Berlin: Springer.en_US
dc.description.abstractVarious filtering algorithms for publish/subscribe systems have been proposed. One distinguishing characteristic is their internal representation of Boolean subscriptions: They either require conversions into DNFs (canonical approaches) or are directly exploited in event filtering (non-canonical approaches). In this paper, we present a detailed analysis and comparison of the memory requirements of canonical and non-canonical filtering algorithms. This includes a theoretical analysis of space usages as well as a verification of our theoretical results by an evaluation of a practical implementation. This practical analysis also considers time (filter) efficiency, which is the other important quality measure of filtering algorithms. By correlating the results of space and time efficiency, we conclude when to use non-canonical and canonical approaches.en_US
dc.publisherSpringer, Berlinen_US
dc.sourceOTM 2005en_NZ
dc.subjectcomputer scienceen_US
dc.subjectfiltering algorithmsen_US
dc.titleA detailed investigation of memory requirements for publish/subscribe filtering algorithmsen_US
dc.typeConference Contributionen_US
dc.relation.isPartOfOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, Part 1en_NZ
pubs.volumeLNCS 3760en_NZ

Files in this item


There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record