P. T. Eugster, P. A. Felber, R. Guerraoui, and A. Kermarrec, The many faces of publish/subscribe, ACM Computing Surveys (CSUR), vol.35, issue.2, pp.114-131, 2003.
DOI : 10.1145/857076.857078

A. Shraer, M. Gurevich, M. Fontoura, and V. Josifovski, Top-k publishsubscribe for social annotation of news, Proceedings of the Vldb Endowment, vol.6, pp.385-396, 2013.
DOI : 10.14778/2536336.2536340
URL : http://static.googleusercontent.com/external_content/untrusted_dlcp/research.google.com/en/us/pubs/archive/40815.pdf

R. Barazzutti, T. Heinze, A. Martin, E. Onica, P. Felber et al., Elastic scaling of a high-throughput content-based publish/subscribe engine, IEEE ICDCS 2014, pp.567-576

X. Ma, Y. Wang, X. Pei, and F. Xu, A cloud-assisted publish/subscribe service for time-critical dissemination of bulk content, Concurrency and Computation: Practice and Experience, vol.29, issue.8, pp.1-15, 2017.

Y. Wang and X. Ma, A general scalable and elastic content-based publish/subscribe service, IEEE Transactions on Parallel & Distributed Systems, vol.26, issue.8, pp.2100-2113, 2015.
DOI : 10.1109/tpds.2014.2346759

Y. Zhao and J. Wu, Towards approximate event processing in a largescale content-based network, IEEE ICDCS 2011, pp.790-799
DOI : 10.1109/icdcs.2011.67
URL : http://www.cis.temple.edu/~wu/research/publications/Publication_files/Towards Approximate Event Processing in A Large-Scale Content-Based Network.pdf

W. Fan, Y. Liu, and B. Tang, Gem: An analytic geometrical approach to fast event matching for multi-dimensional content-based publish/subscribe services, IEEE INFOCOM 2016, pp.1-9
DOI : 10.1109/infocom.2016.7524338

S. Qian, J. Cao, Y. Zhu, and M. Li, Rein: A fast event matching approach for content-based publish/subscribe systems, IEEE INFO-COM 2014, pp.2058-2066

S. Qian, J. Cao, Y. Zhu, M. Li, and J. Wang, H-tree: An efficient index structurefor event matching in content-basedpublish/subscribe systems, IEEE Transactions on Parallel and Distributed Systems, vol.26, issue.6, pp.1622-1632, 2015.

M. Sadoghi and H. Jacobsen, Be-tree: an index structure to efficiently match boolean expressions over high-dimensional discrete space, ACM SIGMOD 2011, pp.637-648

M. K. Aguilera, R. E. Strom, D. C. Sturman, M. Astley, and T. D. Chandra, Matching events in a content-based subscription system, ACM PODC 1999, pp.53-61
DOI : 10.1145/301308.301326
URL : http://www.cs.cornell.edu/Courses/cs614/2003SP/papers/ASS99.pdf

D. Zhang, C. Chan, and K. Tan, An efficient publish/subscribe index for e-commerce databases, Proceedings of the VLDB Endowment, vol.7, pp.613-624, 2014.
DOI : 10.14778/2732296.2732298
URL : http://www.vldb.org/pvldb/vol7/p613-zhang.pdf

A. Carzaniga and A. L. Wolf, Forwarding in a content-based network, ACM SIGCOMM 2003, pp.163-174

S. E. Whang, H. Garcia-molina, C. Brower, J. Shanmugasundaram, S. Vassilvitskii et al., Indexing boolean expressions, Proceedings of the VLDB Endowment, vol.2, pp.37-48, 2009.

W. Fan, Y. A. Liu, and B. Tang, Dexin: A fast content-based multiattribute event matching algorithm using dynamic exclusive and inclusive methods, Future Generation Computer Systems, vol.68, pp.289-303, 2017.

H. Jafarpour, S. Mehrotra, N. Venkatasubramanian, and M. Montanari, Mics: an efficient content space representation model for publish/subscribe systems, ACM DEBS 2009, pp.1-12

H. A. Jacobsen, H. A. Jacobsen, and H. A. Jacobsen, Omen: overlay mending for topic-based publish/subscribe systems under churn, ACM DEBS 2016, pp.105-116

J. Gascon-samson, F. P. Garcia, B. Kemme, and J. Kienzle, Dynamoth: A scalable pub/sub middleware for latency-constrained applications in the cloud, IEEE ICDCS 2015, pp.486-496

A. K. Cheung and H. A. Jacobsen, Load balancing content-based publish/subscribe systems, Acm Transactions on Computer Systems, vol.28, issue.4, pp.1-55, 2010.

. Wind, , 2018.

G. K. Zipf, Relative frequency as a determinant of phonetic change, Harvard studies in classical philology, vol.40, pp.1-95, 1929.

L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, Web caching and zipf-like distributions: Evidence and implications, IEEE INFOCOM 1999, vol.1, pp.126-134

S. Brin and L. Page, The anatomy of a large-scale hypertextual web search engine, vol.30, pp.107-117, 1998.

P. Baldi and K. Hornik, Neural networks and principal component analysis: Learning from examples without local minima, Neural Networks, vol.2, issue.1, pp.53-58, 1989.

R. L. Thorndike, Who belongs in the family, Psychometrika, vol.18, issue.4, pp.267-276, 1953.

K. H. Ang, G. Chong, and Y. Li, Pid control system analysis, design, and technology, IEEE Transactions on Control Systems Technology, vol.13, issue.4, pp.559-576, 2005.