A detailed investigation of memory requirements for publish/subscribe filtering algorithms

Simple item page
dc.contributor.authorBittner, Sven
dc.contributor.authorHinze, Annika
dc.coverage.spatialConference held at Cyprusen_NZ
dc.date.accessioned2008-11-19T20:11:21Z
dc.date.available2008-11-19T20:11:21Z
dc.date.issued2005
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.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.identifier.doi10.1007/11575771_12en_US
dc.identifier.urihttps://hdl.handle.net/10289/1395
dc.language.isoen
dc.publisherSpringer, Berlinen_US
dc.relation.isPartOfOn the Move to Meaningful Internet Systems 2005: CoopIS, DOA, and ODBASE, Part 1en_NZ
dc.relation.urihttp://www.springerlink.com/content/akmt067hwlx40byr/en_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
pubs.begin-page148en_NZ
pubs.elements-id15913
pubs.end-page165en_NZ
pubs.finish-date2005-11-04en_NZ
pubs.place-of-publicationGermanyen_NZ
pubs.start-date2005-10-31en_NZ
pubs.volumeLNCS 3760en_NZ
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description:
Name: license.txt
Size: 1.79 KB
Kind: License
Collections
Computing and Mathematical Sciences Papers