{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T18:19:14Z","timestamp":1766600354562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030859275"},{"type":"electronic","value":"9783030859282"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85928-2_43","type":"book-chapter","created":{"date-parts":[[2021,9,8]],"date-time":"2021-09-08T12:12:16Z","timestamp":1631103136000},"page":"547-558","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Fat Topic: Improving Latency in Content-Based Publish\/Subscribe Systems on Apache Kafka"],"prefix":"10.1007","author":[{"given":"Shiyou","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiawei","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guangtao","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junshen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,2]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Chockler, G., Melamed, R., Tock, Y., Vitenberg, R.: SpiderCast: a scalable interest-aware overlay for topic-based pub\/sub communication. In: Proceedings of the 2007 Inaugural International Conference on Distributed Event-based Systems, pp. 14\u201325 (2007)","DOI":"10.1145\/1266894.1266899"},{"issue":"3","key":"43_CR2","doi-asserted-by":"publisher","first-page":"1954","DOI":"10.1109\/TNSM.2020.3003535","volume":"17","author":"A Detti","year":"2020","unstructured":"Detti, A., Funari, L., Blefari-Melazzi, N.: Sub-linear scalability of MQTT clusters in topic-based publish-subscribe applications. IEEE Trans. Netw. Serv. Manage. 17(3), 1954\u20131968 (2020)","journal-title":"IEEE Trans. Netw. Serv. Manage."},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"Ding, T., Qian, S., Cao, J., Xue, G., Li, M.: SCSL: optimizing matching algorithms to improve real-time for content-based pub\/sub systems. In: 2020 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 148\u2013157. IEEE (2020)","DOI":"10.1109\/IPDPS47924.2020.00025"},{"issue":"4","key":"43_CR4","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1109\/TPDS.2020.3036014","volume":"32","author":"T Ding","year":"2020","unstructured":"Ding, T., et al.: MO-Tree: an efficient forwarding engine for spatiotemporal-aware pub\/sub systems. IEEE Trans. Parallel Distrib. Syst. 32(4), 855\u2013866 (2020)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"43_CR5","doi-asserted-by":"crossref","unstructured":"Dobbelaere, P., Esmaili, K.S.: Kafka versus RabbitMQ: a comparative study of two industry reference publish\/subscribe implementations: industry paper. In: Proceedings of the 11th ACM International Conference on Distributed and Event-based Systems, pp. 227\u2013238 (2017)","DOI":"10.1145\/3093742.3093908"},{"issue":"2","key":"43_CR6","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/857076.857078","volume":"35","author":"PT Eugster","year":"2003","unstructured":"Eugster, P.T., Felber, P.A., Guerraoui, R., Kermarrec, A.M.: The many faces of publish\/subscribe. ACM Comput. Surv. (CSUR) 35(2), 114\u2013131 (2003)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"43_CR7","doi-asserted-by":"publisher","unstructured":"Ji, S., Jacobsen, H.A.: Ps-tree-based efficient Boolean expression matching for high-dimensional and dense workloads. Proc. VLDB Endowment 12(3), 251\u2013264 (2018). https:\/\/doi.org\/10.14778\/3291264.3291270","DOI":"10.14778\/3291264.3291270"},{"issue":"4","key":"43_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1145\/1594977.1592592","volume":"39","author":"P Jokela","year":"2009","unstructured":"Jokela, P., Zahemszky, A., Esteve Rothenberg, C., Arianfar, S., Nikander, P.: LIPSIN: line speed publish\/subscribe inter-networking. ACM SIGCOMM Comput. Commun. Rev. 39(4), 195\u2013206 (2009)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"43_CR9","first-page":"1","volume":"11","author":"J Kreps","year":"2011","unstructured":"Kreps, J., Narkhede, N., Rao, J., et al.: Kafka: a distributed messaging system for log processing. Proc. NetDB. 11, 1\u20137 (2011)","journal-title":"Proc. NetDB."},{"key":"43_CR10","doi-asserted-by":"crossref","unstructured":"Liao, Z., et al.: PhSIH: a lightweight parallelization of event matching in content-based pub\/sub systems. In: Proceedings of the 48th International Conference on Parallel Processing, pp. 1\u201310 (2019)","DOI":"10.1145\/3337821.3337859"},{"key":"43_CR11","doi-asserted-by":"crossref","unstructured":"Martins, J.L., Duarte, S.: Routing algorithms for content-based publish\/subscribe systems. IEEE Commun. Surv. Tutorials 12(1) (2010)","DOI":"10.1109\/SURV.2010.020110.00065"},{"key":"43_CR12","doi-asserted-by":"crossref","unstructured":"Muhl, G., Fiege, L., Gartner, F.C., Buchmann, A.: Evaluating advanced routing algorithms for content-based publish\/subscribe systems. In: 10th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunications Systems, MASCOTS 2002. Proceedings, pp. 167\u2013176. IEEE (2002)","DOI":"10.1109\/MASCOT.2002.1167074"},{"key":"43_CR13","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.comnet.2018.12.001","volume":"149","author":"S Qian","year":"2019","unstructured":"Qian, S., et al.: A fast and anti-matchability matching algorithm for content-based publish\/subscribe systems. Comput. Netw. 149, 213\u2013225 (2019)","journal-title":"Comput. Netw."},{"key":"43_CR14","doi-asserted-by":"crossref","unstructured":"Qian, S., Cao, J., Zhu, Y., Li, M.: REIN: a fast event matching approach for content-based publish\/subscribe systems. In: IEEE INFOCOM 2014-IEEE Conference on Computer Communications, pp. 2058\u20132066. IEEE (2014)","DOI":"10.1109\/INFOCOM.2014.6848147"},{"issue":"6","key":"43_CR15","doi-asserted-by":"publisher","first-page":"1622","DOI":"10.1109\/TPDS.2014.2323262","volume":"26","author":"S Qian","year":"2015","unstructured":"Qian, S., Cao, J., Zhu, Y., Li, M., Wang, J.: H-Tree: an efficient index structure for event matching in content-based publish\/subscribe systems. IEEE Trans. Parallel Distrib. Syst. 26(6), 1622\u20131632 (2015). https:\/\/doi.org\/10.1109\/TPDS.2014.2323262","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"Qian, S., Mao, W., Cao, J., Le Mou\u00ebl, F., Li, M.: Adjusting matching algorithm to adapt to workload fluctuations in content-based publish\/subscribe systems. In: IEEE INFOCOM 2019-IEEE Conference on Computer Communications, pp. 1936\u20131944. IEEE (2019)","DOI":"10.1109\/INFOCOM.2019.8737647"},{"key":"43_CR17","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-030-50454-0_2","volume-title":"Complex, Intelligent and Software Intensive Systems","author":"T Saito","year":"2021","unstructured":"Saito, T., Nakamura, S., Enokido, T., Takizawa, M.: A topic-based publish\/subscribe system in a fog computing model for the IoT. In: Barolli, L., Poniszewska-Maranda, A., Enokido, T. (eds.) CISIS 2020. AISC, vol. 1194, pp. 12\u201321. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-50454-0_2"},{"key":"43_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-030-60239-0_40","volume-title":"Algorithms and Architectures for Parallel Processing","author":"J Xu","year":"2020","unstructured":"Xu, J., et al.: Roda: a flexible framework for real-time on-demand data aggregation. In: Qiu, M. (ed.) ICA3PP 2020. LNCS, vol. 12453, pp. 587\u2013602. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60239-0_40"},{"issue":"8","key":"43_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.14778\/2732296.2732298","volume":"7","author":"D Zhang","year":"2014","unstructured":"Zhang, D., Chan, C.Y., Tan, K.L.: An efficient publish\/subscribe index for e-commerce databases. Proc. VLDB Endowment 7(8), 613\u2013624 (2014)","journal-title":"Proc. VLDB Endowment"},{"key":"43_CR20","doi-asserted-by":"crossref","unstructured":"Zhao, Y., Wu, J.: Towards approximate event processing in a large-scale content-based network. In: 2011 31st International Conference on Distributed Computing Systems, pp. 790\u2013799. IEEE (2011)","DOI":"10.1109\/ICDCS.2011.67"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85928-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:14:33Z","timestamp":1725758073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85928-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030859275","9783030859282"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85928-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WASA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Wireless Algorithms, Systems, and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wasa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wasa-conference.org\/WASA2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"315","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}