Dynamic filter merging and mergeability detection for publish/subscribe

Pervasive and Mobile Computing

Volumn 4, Issue 5, 2008, Pages 681-696

  Tarkoma, Sasu ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b NOKIA RESEARCH CENTER   (United States)

Author keywords

Content based routing; Filter merging; Publish subscribe

Indexed keywords

BANDPASS FILTERS; INFORMATION DISSEMINATION; ROUTERS;

CONTENT BASED ROUTING; CONTENT-BASED ROUTERS; DISTRIBUTED ENVIRONMENTS; DISTRIBUTED STATE; FILTER MERGING; OPTIMIZATION STRATEGY; OVERLAY STRUCTURES; PUBLISH/SUBSCRIBE;

MERGING;

EID: 51849129990     PISSN: 15741192     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.pmcj.2008.04.007     Document Type: Article

References (26)

1. Eugster P.T., Felber P.A., Guerraoui R., and Kermarrec A.-M. The many faces of publish/subscribe. ACM Comput. Surv. 35 2 (2003) 114-131
2. A. Carzaniga, A.L. Wolf, Forwarding in a content-based network, in: Proceedings of ACM SIGCOMM 2003, Karlsruhe, Germany, 2003, pp. 163-174
3. G. Mühl, Large-scale content-based publish/subscribe systems, Ph.D. Thesis, Darmstadt University of Technology, September 2002
4. A. Carzaniga, J. Deng, A.L. Wolf, Fast forwarding for content-based networking, Tech. Rep. CU-CS-922-01, Department of Computer Science, University of Colorado, Nov. 2001. http://www.cs.colorado.edu/~carzanig/papers/index.html
5. Cao F., and Singh J.P. Efficient event routing in content-based publish-subscribe service networks. Proceedings of IEEE INFOCOM 2004 (2004), IEEE, Hong Kong, China
6. F. Fabret, H.A. Jacobsen, F. Llirbat, J. Pereira, K. Ross, D. Shasha, Filtering algorithms and implementation for very fast publish/subscribe, in: T. Sellis, S. Mehrotra (Eds.), Proceedings of the 20th Intl. Conference on Management of Data, SIGMOD 2001, Santa Barbara, CA, USA, 2001, pp. 115-126
7. S. Tarkoma, J. Kangasharju, Filter merging for efficient information dissemination., in: CoopIS, 2005, pp. 274-291
8. S. Tarkoma, Efficient content-based routing, mobility-aware topologies, and temporal subspace matching, Ph.D. thesis, Department of Computer Science, University of Helsinki, available at ethesis.helsinki.fi, 2006
9. Mühl G., Fiege L., Gärtner F.C., and Buchmann A.P. Evaluating advanced routing algorithms for content-based publish/subscribe systems. In: Boukerche A., Das S.K., and Majumdar S. (Eds). The Tenth IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems. MASCOTS 2002 (2002), IEEE Press, Fort Worth, TX, USA 167-176
10. Crespo A., Buyukkokten O., and Garcia-Molina H. Query merging: Improving query subscription processing in a multicast environment. IEEE Trans. Knowl. Data Eng. 15 1 (2003) 174-191
11. Wang Y.-M., Qiu L., Achlioptas D., Das G., Larson P., and Wang H.J. Subscription partitioning and routing in content-based publish/subscribe networks. In: Malkhi D. (Ed). Distributed Algorithms. Lecture Notes in Computer Science vol. 2508/2002 (2002)
12. Wang Y.-M., Qiu L., Verbowski C., Achlioptas D., Das G., and Larson P. Summary-based routing for content-based event distribution networks. SIGCOMM Comput. Commun. Rev. 34 5 (2004) 59-74
13. Bloom B.H. Space/time trade-offs in hash coding with allowable errors. Commun. ACM 13 7 (1970) 422-426
14. Böhm C., Berchtold S., and Keim D.A. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33 3 (2001) 322-373
15. P. Triantafillou, A. Economides, Subscription summaries for scalability and efficiency in publish/subscribe systems, in: J. Bacon, L. Fiege, R. Guerraoui, A. Jacobsen, G. Mühl (Eds.), Proceedings of the 1st International Workshop on Distributed Event-Based Systems, DEBS'02, 2002
16. P. Triantafillou, A. Economides, Subscription summarization: A new paradigm for efficient publish/subscribe systems, in: ICDCS, IEEE Computer Society, 2004, pp. 562-571
17. Campailla A., Chaki S., Clarke E., Jha S., and Veith H. Efficient filtering in publish-subscribe systems using binary decision diagrams. ICSE '01: Proceedings of the 23rd International Conference on Software Engineering (2001), IEEE Computer Society, Washington, DC, USA 443-452
18. G. Li, S. Hou, H.-A. Jacobsen, A unified approach to routing, covering and merging in publish/subscribe systems based on modified binary decision diagrams, in: ICDCS, IEEE Computer Society, 2005, pp. 447-457
19. Carzaniga A., Rosenblum D.S., and Wolf A.L. Design and evaluation of a wide-area event notification service. ACM Trans. Comput. Syst. 19 3 (2001) 332-383
20. A. Kiani, N. Shiri, Containment of conjunctive queries with arithmetic expressions, in: CoopIS, 2005, pp. 439-452
21. C.Y. Chan, W. Fan, P. Felber, M.N. Garofalakis, R. Rastogi, Tree pattern aggregation for scalable XML data dissemination, in: VLDB, 2002, pp. 826-837
22. Ouksel A.M., Jurca O., Podnar I., and Aberer K. Efficient probabilistic subsumption checking for content-based publish/subscribe systems. In: van Steen M., and Henning M. (Eds). Middleware. Lecture Notes in Computer Science vol. 4290 (2006), Springer 121-140
23. Tarkoma S., and Kangasharju J. Optimizing content-based routers: Posets and forests. Distr. Comput. 19 1 (2006) 62-77
24. J. Antollini, M. Antollini, P. Guerrero, M. Cilia, Extending Rebeca to support concept-based addressing, in: First Argentine Symposium on Information Systems, ASIS 2004, 2004
25. Mühl G., Fiege L., and Buchmann A.P. Filter similarities in content-based publish/subscribe systems. In: Schmeck H., Ungerer T., and Wolf L. (Eds). International Conference on Architecture of Computing Systems. ARCS. Lecture Notes in Computer Science vol. 2299 (2002), Springer-Verlag, Karlsruhe, Germany 224-238
26. C. Mitidieri, J. Kaiser, Attribute-based filtering: Improving the expressiveness while keeping the predictability in P/S systems, in: Proceedings of the 2nd International Workshop on Distributed Event-Based Systems, DEBS'03, 2003