{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T15:59:51Z","timestamp":1772726391132,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030953904","type":"print"},{"value":"9783030953911","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95391-1_10","type":"book-chapter","created":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:04:54Z","timestamp":1645520694000},"page":"152-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["BMTP: Combining Backward Matching with Tree-Based Pruning for Large-Scale Content-Based Pub\/Sub Systems"],"prefix":"10.1007","author":[{"given":"Zhengyu","family":"Liao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiyou","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhonglong","family":"Zheng","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":"Minglu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,2,23]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Ca\u00f1as, C., Zhang, K., Kemme, B., Kienzle, J., Jacobsen, H.A.: Publish\/subscribe network designs for multiplayer games. In: Proceedings of the 15th International Middleware Conference, pp. 241\u2013252. ACM (2014). https:\/\/doi.org\/10.1145\/2663165.2663337","DOI":"10.1145\/2663165.2663337"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Chandramouli, B., Yang, J.: End-to-end support for joins in large-scale publish\/subscribe systems. Proc. VLDB Endow. 1(1), 434\u2013450 (2008). https:\/\/doi.org\/10.14778\/1453856.1453905","DOI":"10.14778\/1453856.1453905"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Chen, C., Vitenberg, R., Jacobsen, H.A.: Building fault-tolerant overlays with low node degrees for topic-based publish\/subscribe. IEEE Trans. Dependable Secure Comput. (Early Access), 1\u201317 (2021). https:\/\/doi.org\/10.1109\/TDSC.2021.3080281","DOI":"10.1109\/TDSC.2021.3080281"},{"key":"10_CR4","doi-asserted-by":"publisher","unstructured":"Chen, L., et al.: Top-k term publish\/subscribe for geo-textual data streams. VLDB J. 29(5), 1101\u20131128 (2020). https:\/\/doi.org\/10.1007\/s00778-020-00607-8","DOI":"10.1007\/s00778-020-00607-8"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Demers, A., Gehrke, J., Hong, M., Riedewald, M., White, W.: Towards expressive publish\/subscribe systems. In: International Conference on Extending Database Technology, pp. 627\u2013644. Springer (2006) https:\/\/doi.org\/10.1007\/11687238_38","DOI":"10.1007\/11687238_38"},{"key":"10_CR6","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: IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 148\u2013157 (2020)","DOI":"10.1109\/IPDPS47924.2020.00025"},{"key":"10_CR7","doi-asserted-by":"publisher","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 (2021). https:\/\/doi.org\/10.1109\/TPDS.2020.3036014","DOI":"10.1109\/TPDS.2020.3036014"},{"issue":"2","key":"10_CR8","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. 35(2), 114\u2013131 (2003). https:\/\/doi.org\/10.1145\/857076.857078","journal-title":"ACM Comput. Surv."},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Fan, W., Liu, Y., Tang, B.: Gem: an analytic geometrical approach to fast event matching for multi-dimensional content-based publish\/subscribe services. In: IEEE International Conference on Computer Communications (INFOCOM), pp. 1\u20139 (2016). https:\/\/doi.org\/10.1109\/INFOCOM.2016.7524338","DOI":"10.1109\/INFOCOM.2016.7524338"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Gupta, A., Sahin, O.D., Agrawal, D., El Abbadi, A.: Meghdoot: content-based publish\/subscribe over p2p networks. In: ACM\/IFIP\/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing, pp. 254\u2013273. Springer, Berlin Heidelberg (2004) https:\/\/doi.org\/10.1007\/978-3-540-30229-2_14","DOI":"10.1007\/978-3-540-30229-2_14"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Jergler, M., Zhang, K., Jacobsen, H.A.: Multi-client transactions in distributed publish\/subscribe systems. In: 2018 IEEE 38th International Conference on Distributed Computing Systems (ICDCS), pp. 120\u2013131 (2018). https:\/\/doi.org\/10.1109\/ICDCS.2018.00022","DOI":"10.1109\/ICDCS.2018.00022"},{"key":"10_CR12","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 Endow. 12(3), 251\u2013264 (2018). https:\/\/doi.org\/10.14778\/3291264.3291270","DOI":"10.14778\/3291264.3291270"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Ji, S., Jacobsen, H.A.: A-tree: a dynamic data structure for efficiently indexing arbitrary boolean expressions. In: Proceedings of the 2021 International Conference on Management of Data. SIGMOD\/PODS \u201921, pp. 817\u2013829 (2021). https:\/\/doi.org\/10.1145\/3448016.3457266","DOI":"10.1145\/3448016.3457266"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1658373.1658375","volume":"4","author":"G Li","year":"2010","unstructured":"Li, G., Muthusamy, V., Jacobsen, H.A.: A distributed service-oriented architecture for business process execution. ACM Trans. Web 4(1), 1\u201333 (2010). https:\/\/doi.org\/10.1145\/1658373.1658375","journal-title":"ACM Trans. Web"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Machanavajjhala, A., Vee, E., Garofalakis, M., Shanmugasundaram, J.: Scalable ranked publish\/subscribe. Proc. VLDB Endow. 1(1), 451\u2013462 (2008). https:\/\/doi.org\/10.14778\/1453856.1453906","DOI":"10.14778\/1453856.1453906"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Mahmood, A.R., et al.: Adaptive processing of spatial-keyword data over a distributed streaming cluster. In: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 219\u2013228 (2018). https:\/\/doi.org\/10.1145\/3274895.3274932","DOI":"10.1145\/3274895.3274932"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Moll, P., Isak, S., Hellwagner, H., Burke, J.: A quadtree-based synchronization protocol for inter-server game state synchronization. Comput. Netw. 185, 107723 (2021). https:\/\/doi.org\/10.1016\/j.comnet.2020.107723","DOI":"10.1016\/j.comnet.2020.107723"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Qian, S., et al.: A fast and anti-matchability matching algorithm for content-based publish\/subscribe systems. Comput. Netw. 149, 213\u2013225 (2019). https:\/\/doi.org\/10.1016\/j.comnet.2018.12.001","DOI":"10.1016\/j.comnet.2018.12.001"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Qian, S., Cao, J., Zhu, Y., Li, M.: Rein: a fast event matching approach for content-based publish\/subscribe systems. In: IEEE Conference on Computer Communications (INFOCOM), pp. 2058\u20132066 (2014). https:\/\/doi.org\/10.1109\/INFOCOM.2014.6848147","DOI":"10.1109\/INFOCOM.2014.6848147"},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Qian, S., Cao, J., Zhu, Y., Li, M., Wang, J.: H-tree: an efficient index structurefor event matching in content-basedpublish\/subscribe systems. IEEE Trans. Parallel Distrib. Syst. 26(6), 1622\u20131632 (2015). https:\/\/doi.org\/10.1109\/TPDS.2014.2323262","DOI":"10.1109\/TPDS.2014.2323262"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Qian, S., Mao, W., Cao, J., Mou\u00ebl, F.L., Li, M.: Adjusting matching algorithm to adapt to workload fluctuations in content-based publish\/subscribe systems. In: IEEE Conference on Computer Communications (INFOCOM), pp. 1936\u20131944 (2019). https:\/\/doi.org\/10.1109\/INFOCOM.2019.8737647","DOI":"10.1109\/INFOCOM.2019.8737647"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Sadoghi, M., Jergler, M., Jacobsen, H.A., Hull, R., Vacul\u00edn, R.: Safe distribution and parallel execution of data-centric workflows over the publish\/subscribe abstraction. IEEE Trans. Knowl. Data Eng. 27(10), 2824\u20132838 (2015). https:\/\/doi.org\/10.1109\/TKDE.2015.2421331","DOI":"10.1109\/TKDE.2015.2421331"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"Shen, H.: Content-based publish\/subscribe systems. In: Handbook of Peer-to-peer Networking, pp. 1333\u20131366. Springer (2010) https:\/\/doi.org\/10.1007\/978-3-540-24629-9_11","DOI":"10.1007\/978-3-540-24629-9_11"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Zhang, D., Chan, C.Y., Tan, K.L.: An efficient publish\/subscribe index for e-commerce databases. Proc. VLDB Endow. 7(8), 613\u2013624 (2014). https:\/\/doi.org\/10.14778\/2732296.2732298","DOI":"10.14778\/2732296.2732298"},{"key":"10_CR25","doi-asserted-by":"publisher","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 (2011). https:\/\/doi.org\/10.1109\/ICDCS.2011.67","DOI":"10.1109\/ICDCS.2011.67"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95391-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,22]],"date-time":"2022-02-22T09:06:56Z","timestamp":1645520816000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95391-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030953904","9783030953911"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95391-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"23 February 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2021\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"403","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":"145","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":"0","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":"36% - 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.12","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":"2.27","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)"}}]}}