Show simple item record  

dc.contributor.authorBittner, Svenen_US
dc.contributor.authorHinze, Annikaen_US
dc.date.accessioned2008-03-19T04:58:16Z
dc.date.available2007-05-07en_US
dc.date.available2008-03-19T04:58:16Z
dc.date.issued2005-01-01en_US
dc.identifier.citationBittner, S. & Hinze, A. (2005). Investigating the memory requirements for publish/subscribe filtering algorithms. (Working paper series. University of Waikato, Department of Computer Science. No. 03/2005). Hamilton, New Zealand: University of Waikato.en_US
dc.identifier.urihttps://hdl.handle.net/10289/73
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 to disjunctive normal forms (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.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherDepartment of Computer Scienceen_NZ
dc.subjectcomputer science
dc.titleInvestigating the memory requirements for publish/subscribe filtering algorithmsen_US
dc.typeWorking Paperen_US
pubs.elements-id53007
pubs.place-of-publicationHamiltonen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record