Pubsub: An efficient publish/subscribe system

IEEE Transactions on Computers

Volumn 64, Issue 4, 2015, Pages 1119-1132

  Banerjee Mishra, Tania ^a   Sahni, Sartaj ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Boolean expressions; Content based publish subscribe; efficient subscription matching

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FORESTRY; PUBLISHING;

BOOLEAN EXPRESSIONS; CONTENT-BASED PUBLISH; CONTENT-BASED PUBLISH/SUBSCRIBE SYSTEMS; EFFICIENT DATA STRUCTURES; EFFICIENT SUBSCRIPTION MATCHING; EVENT MATCHING ALGORITHMS; PUBLISH/SUBSCRIBE SYSTEM; RUN-TIME PERFORMANCE;

TREES (MATHEMATICS);

ALGORITHMS; INFORMATION RETRIEVAL; PUBLISHING;

EID: 84925070599     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2014.2315636     Document Type: Article

References (25)

1. M. Sadoghi and H.-A. Jacobsen, "BE-Tree: An index structure to efficiently match boolean expressions over high-dimensional discrete space, " in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2011, pp. 637-648.
2. A. Carzaniga, D. Rosenblum, and A. Wolf, "Design and evaluation of wide-area event notification service, " ACM Trans. Comput. Syst., vol. 19, no. 3, pp. 332-383, 2001.
3. A. Carzaniga and A. L. Wolf, "Forwarding in a content-based network, " in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2003, pp. 163-174.
4. H. Lu and S. Sahni, "O(log n) dynamic router-tables for prefixes and ranges, " IEEE Trans. Comput., vol. 53, no. 10, pp. 1217-1230, Oct. 2004.
5. T. W. Yan and H. Garcia-Molina, "Index structures for selective dissemination of information under the boolean model, " ACM Trans. Database Syst., vol. 19, no. 2, pp. 332-364, Jun. 1994.
6. E. M. McCreight, "Priority search trees, " SIAM J. Comput., vol. 14, no. 2, pp. 257-276, May 1985.
7. M. Altinel and M. J. Franklin, "Efficient filtering of XML documents of selective dissemination of information, " in Proc. 26th Int. Conf. Very Large Data Bases, Sept. 2000, pp. 53-64.
8. C. Tryfonopoulos, M. Koubarakis, and Y. Drougas, "Information filtering and query indexing for an information retrieval model, " ACM Trans. Inform. Syst., vol. 27, no. 2, pp. 10:1-10:47, Feb. 2009.
9. N. Nanas, M. Vavalis, and A.N. De Roeck, "A network-basedmodel for high-dimensional information filtering, " in Proc. 33rd Int. ACM SIGIR Conf. Res. Develop. Inform. Retrieval, Aug. 2010, pp. 202-209.
10. M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra, "Matching events in a content-based subscription system, " in Proc. 18th Annu. ACM Symp. Principles Distrib. Comput., 1999, pp. 53-61.
11. F. Fabret, H.-A. Jacobsen, F. Llirbat, J. Pereira, K. A. Ross, and D. Shasha, "Filtering algorithms and implementation for fast pub/sub systems, " in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2001, pp. 115-126.
12. S. Whang, C. Brower, J. Shanmugasundaram, S. Vassilvitskii, E. Vee, R. Yerneni, and H. Garcia-Molina, "Indexing boolean expressions, " Proc. VLDB Endowment, vol. 2, pp. 37-48, 2009.
13. T. W. Yan and H. Garcia-Molina, "The SIFT information dissemination system, " ACM Trans. Database Syst., vol. 24, pp. 529-565, 1999.
14. D. Mehta and S. Sahni, Handbook of Data Structures and Applications. London, U.K.: Chapman & Hall/CRC, 2005.
15. A. Mitra, M. Maheswaran, and J. A. Rueda, "Wide-area contentbased routing mechanism, " in Proc. Int. Parallel Distrib. Process. Symp., 2003.
16. W. Rao, L. Chen, A. W-C. Fu, H. Chen, and F. Zou, "On efficient content matching in distributed pub/sub systems, " in Proc. IEEE Conf. Comput. Commun., 2009, pp. 756-764.
17. F. Cao and J. P. Singh, "Efficient event routing in content-based publish-subscribe service networks, " in Proc. 23rd Annu. Joint Conf. IEEE Comput. Commun. Soc., 2004, pp. 929-940.
18. M. Petrovic, I. Burcea, and H-A. Jacobsen, "S-ToPSS: Semantic toronto publish/subscribe system, " in Proc. 29th Int. Conf. Very Large Data Bases, 2003, pp. 1101-1104.
19. A. Yu, P. K. Agarwal, and J. Yang, "Generating wide-area contentbased publish/subscribe workloads, " in Proc. 5th Int. Workshop Netw. Meets Databases, 2009.
20. A. V. Aho and M. J. Corasick, "Efficient String Matching: An aid to bibliographic search, " Commun. ACM, vol. 18, no. 6, pp. 333-340, Jun. 1975.
21. E. M. McCreight, "A space-economical suffix tree construction algorithm, " J. ACM, vol. 23, no. 2, pp. 262-272, 1973.
22. W. Lu and S. Sahni, "Efficient two-dimensional multibit tries for packet classification, " IEEE Trans. Comput., vol. 58, no. 12, p. 1695-1709, Dec. 2009.
23. J. L. Bentley, "Decomposable searching problems, " Inform. Process. Lett., vol. 8, no. 5, pp. 244-201, 1979.
24. T. Banerjee and S. Sahni, "PUBSUB: An efficient publish/subscribe system, " in Proc. IEEE Symp. Comput. Commun., 2013.
25. T. Banerjee and S. Sahni. (2013). PUBSUB: An efficient publish/subscribe system, [online]. Available: http://www.cise.ufl.edu/~sahni/papers/pubsub.pdf.