000052446 001__ 52446
000052446 005__ 20190316233447.0
000052446 02470 $$2ISI$$a000177124400099
000052446 037__ $$aREP_WORK
000052446 245__ $$aEvent Systems : How to Have Your Cake and Eat It Too
000052446 269__ $$a2002
000052446 260__ $$c2002
000052446 336__ $$aReports
000052446 520__ $$aThis paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing interests in events), and event safety (ensuring encapsulation and type-safe interaction with polymorphic events). We point out some ramifications underlying these tradeoffs and we propose a pragmatic approach to handle them. We achieve scalability using a multi-stage filtering strategy that combines approximate and perfect matching techniques for the purpose of event routing and filtering. We achieve expressiveness and event safety by viewing events as objects; instances of application-defined abstract types.
000052446 6531_ $$aScalability
000052446 6531_ $$aexpressiveness
000052446 6531_ $$aevent safety
000052446 6531_ $$aapproximate filtering
000052446 6531_ $$ahierarchy
000052446 700__ $$aEugster, P. Th.
000052446 700__ $$aFelber, P.
000052446 700__ $$0240335$$g105326$$aGuerraoui, R.
000052446 700__ $$aHandurukande, S. B.
000052446 8564_ $$uhttps://infoscience.epfl.ch/record/52446/files/neg--1206972521main.pdf$$zn/a$$s279546
000052446 909C0 $$xU10407$$0252114$$pDCL
000052446 909CO $$ooai:infoscience.tind.io:52446$$qGLOBAL_SET$$pIC$$preport
000052446 937__ $$aLPD-REPORT-2002-005
000052446 970__ $$a200225/IC
000052446 973__ $$sPUBLISHED$$aEPFL
000052446 980__ $$aREPORT