PUBSUB: An efficient publish/subscribe system

Proceedings - IEEE Symposium on Computers and Communications

Volumn , Issue , 2013, Pages 606-611

  Mishra, Tania Banerjee ^a   Sahni, Sartaj ^a  

^a University of Florida   (United States)

Author keywords

Boolean expressions; Content based publish subscribe; efficient subscription matching

Indexed keywords

FORESTRY; MESSAGE PASSING;

BOOLEAN EXPRESSIONS; CONTENT-BASED PUBLISH; CURRENT CAPABILITY; EFFICIENT DATA STRUCTURES; EFFICIENT SUBSCRIPTION MATCHING; EVENT PROCESSING; FAST MATCHING ALGORITHM; PUBLISH/SUBSCRIBE SYSTEM;

PUBLISHING;

ALGORITHMS; FORESTRY; OPTIMIZATION;

EID: 84897442736     PISSN: 15301346     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISCC.2013.6755014     Document Type: Conference Paper

References (20)

1. M. Sadoghi and H.-A. Jacobsen, BE-Tree: An Index Structure to Efficiently Match Boolean Expressions over High-dimensional Discrete Space, SJGMOD 20J 1.
2. A. Carzaniga, D. Rosenblum, and A. Wolf, Design and evaluation of wide-area event notification service. ACM Trans. on Computer Systems, 19,3,2001,332-383.
3. A. Carzaniga and A. L. Wolf, Forwarding in a Content-Based Network, ACM SJGCOMM 2003.
4. H. Lu and S. Sahni, O(log n) Dynamic Router-Tables for Prefixes and Ranges, JEEE Transactions of Computers Vol. 53, No. 10,2004, 1217-1230.
5. T. W. Yan and H. Garcia-Molina, Index Structures for Selective Dissemination of Information Under the Boolean Model, ACM Tods 1994.
6. E. M. McCreight, Priority Search Trees, Siam J. Comput. Vol. 14, No.2, May 1985, 257-276.
7. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra, Matching events in a content-based subscription system, PODC 1999.
8. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha, Filtering algorithms and implementation for fast pub/sub systems, SJGMOD 2001.
9. S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, Indexing Boolean Expressions, VLDB, 2009.
10. T. W. Yan and H. Garcia-Molina, The SIFT Information Dissemination System. ACM Tods, 1999.
11. D. Mehta and S. Sahni, Handbook of Data Structures and Applications, Chapman & Hall/CRC, 2005.
12. A. Mitra, M. Maheswaran and J. A. Rueda, Wide-Area Content-based Routing Mechanism, IPDPS, 2003.
13. W. Rao, L. Chen, A. W-c. Fu, H. Chen and F. Zou, On Efficient Content Matching in Distributed Pub/Sub Systems, INFOCOM, 2009.
14. F. Cao and J. P. Singh, Efficient Event Routing in Content-based Publish-Subscribe Service Networks, INFOCOM, 2004.
15. M. Petrovic, I. Burcea and H-A. Jacobsen, S-ToPSS: Semantic Toronto Publish/Subscribe System, VLDB, 2003.
16. A. Yu, P. K. Agarwal and L. Yang, Generating Wide-Area Content-Based Publish/Subscribe Workloads, NetDB, 2009.
17. A. Y. Aho and M. 1. Corasick, Efficient String Matching: An Aid to Bibliographic Search, Communications of the ACM, Volume 18, No. 6, June 1975, 333-340.
18. E. M. McCreight, A Space-Economical Suffix Tree Construction Algorithm, Journal of the ACM, Volume 23, No.2, 1973,262-272.
19. W. Lu and S. Sahni, Efficient two-dimensional multibit tries for packet classification, IEEE Transactions on Computers Volume 58, No. 12,2009, 1695-1709.
20. J. L. Bentley, Decomposable searching problems, lriformation Processing Letters, Volume 8, No.5, 1979,244-201.