{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T03:00:08Z","timestamp":1770346808812,"version":"3.49.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","funder":[{"name":"Major Project of ISCAS","award":["ISCAS-ZD-202302"],"award-info":[{"award-number":["ISCAS-ZD-202302"]}]},{"name":"National Key Research and Development Program of China","award":["2022YFB4502002"],"award-info":[{"award-number":["2022YFB4502002"]}]},{"name":"Wuxi Institute of Advanced Technology, NSFC","award":["62032008"],"award-info":[{"award-number":["62032008"]}]},{"DOI":"10.13039\/501100003399","name":"STCSM","doi-asserted-by":"crossref","award":["23511100100"],"award-info":[{"award-number":["23511100100"]}],"id":[{"id":"10.13039\/501100003399","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2025,12,31]]},"abstract":"<jats:p>\n            Boolean expression matching plays an important role in many applications. However, existing solutions still show efficiency and scalability limitations. For example, existing solutions often exhibit degraded performance when applied to high-dimensional and diverse workloads, and existing algorithms rarely consider supporting concurrent matching and index updating under multicore environments. To overcome these limitations, in this article, we first design the\n            <jats:monospace>PS-Tree<\/jats:monospace>\n            data structure to efficiently index Boolean expressions in one dimension. By dividing predicates into disjoint predicate spaces,\n            <jats:monospace>PS-Tree<\/jats:monospace>\n            achieves high matching performance and good expressiveness. Based on the\n            <jats:monospace>PS-Tree<\/jats:monospace>\n            , we propose a Boolean expression matching algorithm called\n            <jats:monospace>PSTDynamic<\/jats:monospace>\n            . By dynamically adjusting the index and efficiently filtering out a large proportion of unmatching expressions,\n            <jats:monospace>PSTDynamic<\/jats:monospace>\n            achieves high matching performance under high-dimensional and diverse workloads. For multicore environment, we further extend the\n            <jats:monospace>PSTDynamic<\/jats:monospace>\n            algorithm to\n            <jats:monospace>PSTParallel<\/jats:monospace>\n            to achieve scalability with lower matching latency and higher matching throughput. We run experiments on both synthetic and real-world datasets. The experiments verify that our proposed algorithms show high efficiency and parallelism. Moreover, they also achieve fast index construction and a small memory footprint. Comprehensive experiments show that our solutions drastically outperform state-of-the-art methods.\n          <\/jats:p>","DOI":"10.1145\/3736756","type":"journal-article","created":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T05:27:17Z","timestamp":1748410037000},"page":"1-41","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Parallel Boolean Expression Matching"],"prefix":"10.1145","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-9212-8879","authenticated-orcid":false,"given":"Shuping","family":"Ji","sequence":"first","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences","place":["Beijing, China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1142-4496","authenticated-orcid":false,"given":"Jianguo","family":"Yao","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University and Jinan Inspur Data Technology Co., Ltd","place":["Shanghai, China"]}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-4941-9237","authenticated-orcid":false,"given":"Wei","family":"Wang","sequence":"additional","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences","place":["Beijing, China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8561-2481","authenticated-orcid":false,"given":"Jun","family":"Wei","sequence":"additional","affiliation":[{"name":"Institute of Software, Chinese Academy of Sciences","place":["Beijing, China"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0813-0101","authenticated-orcid":false,"given":"Hans-Arno","family":"Jacobsen","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, University of Toronto","place":["Toronto, Canada"]}]}],"member":"320","published-online":{"date-parts":[[2025,7,24]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"53","volume-title":"Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing","author":"Aguilera Marcos K.","year":"1999","unstructured":"Marcos K. Aguilera, Robert E. Strom, Daniel C. Sturman, Mark Astley, and Tushar D. Chandra. 1999. Matching events in a content-based subscription system. In Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing. 53\u201361."},{"key":"e_1_3_2_3_2","first-page":"560","volume-title":"Proceedings of the 37th Conference on Foundations of Computer Science","author":"Arge Lars","year":"1996","unstructured":"Lars Arge and Jeffrey Scott Vitter. 1996. Optimal dynamic interval management in external memory. In Proceedings of the 37th Conference on Foundations of Computer Science. IEEE, 560\u2013569."},{"key":"e_1_3_2_4_2","first-page":"217","volume-title":"Proceedings of the International Conference on Database Theory","author":"Beyer Kevin","year":"1999","unstructured":"Kevin Beyer, Jonathan Goldstein, Raghu Ramakrishnan, and Uri Shaft. 1999. When is \u201cnearest neighbor\u201d meaningful?. In Proceedings of the International Conference on Database Theory. Springer, 217\u2013235."},{"key":"e_1_3_2_5_2","first-page":"443","volume-title":"Proceedings of the 23rd International Conference on Software Engineering","author":"Campailla Alexis","year":"2001","unstructured":"Alexis Campailla, Sagar Chaki, Edmund Clarke, Somesh Jha, and Helmut Veith. 2001. Efficient filtering in publish-subscribe systems using binary decision diagrams. In Proceedings of the 23rd International Conference on Software Engineering. IEEE, 443\u2013452."},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/2663165.2663337","volume-title":"Proceedings of the 15th International Middleware Conference","author":"Ca\u00f1as C\u00e9sar","year":"2014","unstructured":"C\u00e9sar Ca\u00f1as, Kaiwen Zhang, Bettina Kemme, J\u00f6rg Kienzle, and Hans-Arno Jacobsen. 2014. Publish\/subscribe network designs for multiplayer games. In Proceedings of the 15th International Middleware Conference. 241\u2013252."},{"key":"e_1_3_2_7_2","first-page":"254","volume-title":"Proceedings of the 26th VLDB","author":"Ceri Stefano","year":"2000","unstructured":"Stefano Ceri, Roberta Cochrane, and Jennifer Widom. 2000. Practical applications of triggers and constraints: Success and lingering issues. In Proceedings of the 26th VLDB. 254\u2013262."},{"issue":"1","key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"434","DOI":"10.14778\/1453856.1453905","article-title":"End-to-end support for joins in large-scale publish\/subscribe systems","volume":"1","author":"Chandramouli Badrish","year":"2008","unstructured":"Badrish Chandramouli and Jun Yang. 2008. End-to-end support for joins in large-scale publish\/subscribe systems. Proceedings of the VLDB Endowment 1, 1 (2008), 434\u2013450.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_9_2","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","year":"2009","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. MIT Press."},{"key":"e_1_3_2_10_2","first-page":"312","volume-title":"Proceedings of the ACM\/IFIP\/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing","author":"Cugola Gianpaolo","year":"2012","unstructured":"Gianpaolo Cugola and Alessandro Margara. 2012. High-performance location-aware publish-subscribe on GPUs. In Proceedings of the ACM\/IFIP\/USENIX International Conference on Distributed Systems Platforms and Open Distributed Processing. Springer, 312\u2013331."},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Proceedings of the Computational Geometry","author":"Berg Mark De","year":"2000","unstructured":"Mark De Berg, Marc Van Kreveld, Mark Overmars, and Otfried Cheong Schwarzkopf. 2000. Computational geometry. In Proceedings of the Computational Geometry. Springer, 1\u201317."},{"key":"e_1_3_2_12_2","first-page":"295","volume-title":"Papers Presented at the the March 3-5, 1959, Western Joint Computer Conference","author":"Briandais Rene De La","year":"1959","unstructured":"Rene De La Briandais. 1959. File searching using variable length keys. In Papers Presented at the the March 3-5, 1959, Western Joint Computer Conference. 295\u2013298."},{"issue":"4","key":"e_1_3_2_13_2","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1145\/958942.958947","article-title":"Path sharing and predicate evaluation for high-performance XML filtering","volume":"28","author":"Diao Yanlei","year":"2003","unstructured":"Yanlei Diao, Mehmet Altinel, Michael J. Franklin, Hao Zhang, and Peter Fischer. 2003. Path sharing and predicate evaluation for high-performance XML filtering. ACM Transactions on Database Systems 28, 4 (2003), 467\u2013516.","journal-title":"ACM Transactions on Database Systems"},{"key":"e_1_3_2_14_2","first-page":"148","volume-title":"Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium","author":"Ding Tianchen","year":"2020","unstructured":"Tianchen Ding, Shiyou Qian, Jian Cao, Guangtao Xue, and Minglu Li. 2020. Scsl: Optimizing matching algorithms to improve real-time for content-based pub\/sub systems. In Proceedings of the 2020 IEEE International Parallel and Distributed Processing Symposium. IEEE, 148\u2013157."},{"key":"e_1_3_2_15_2","first-page":"236","volume-title":"Proceedings of the 2020 IEEE Intl Conf on Parallel and Distributed Processing with Applications, Big Data and Cloud Computing, Sustainable Computing and Communications, Social Computing and Networking","author":"Ding Tianchen","year":"2020","unstructured":"Tianchen Ding, Shiyou Qian, Weidong Zhu, Jian Cao, Guangtao Xue, Yanmin Zhu, and Wenjuan Li. 2020. Comat: An effective composite matching framework for content-based pub\/sub systems. In Proceedings of the 2020 IEEE Intl Conf on Parallel and Distributed Processing with Applications, Big Data and Cloud Computing, Sustainable Computing and Communications, Social Computing and Networking. IEEE, 236\u2013243."},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/375663.375677","volume-title":"Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data","author":"Fabret Fran\u00e7oise","year":"2001","unstructured":"Fran\u00e7oise Fabret, H. Arno Jacobsen, Fran\u00e7ois Llirbat, Jo\u0103o Pereira, Kenneth A. Ross, and Dennis Shasha. 2001. Filtering algorithms and implementation for very fast publish\/subscribe systems. In Proceedings of the 2001 ACM SIGMOD International Conference on Management of Data. 115\u2013126."},{"key":"e_1_3_2_17_2","unstructured":"Facebook. 2024. Retrieved December 01 2024 from https:\/\/newsroom.fb.com\/company-info"},{"key":"e_1_3_2_18_2","first-page":"1","volume-title":"Proceedings of the IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications","author":"Fan Wenhao","year":"2016","unstructured":"Wenhao Fan, Yuan\u2019an Liu, and Bihua Tang. 2016. Gem: An analytic geometrical approach to fast event matching for multi-dimensional content-based publish\/subscribe services. In Proceedings of the IEEE INFOCOM 2016-The 35th Annual IEEE International Conference on Computer Communications. IEEE, 1\u20139."},{"key":"e_1_3_2_19_2","first-page":"5668","volume-title":"Proceedings of the 2020 IEEE International Conference on Big Data.","author":"Feng Qingling","year":"2020","unstructured":"Qingling Feng, Ruisheng Shi, Qifeng Luo, Lina Lan, and Jinqiao Shi. 2020. Scalable blind matching: An efficient ciphertext matching scheme for content-based pub\/sub cloud services. In Proceedings of the 2020 IEEE International Conference on Big Data.IEEE, 5668\u20135670."},{"key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/1807167.1807171","volume-title":"Proceedings of the 2010 ACM SIGMOD International Conference on Management of data","author":"Fontoura Marcus","year":"2010","unstructured":"Marcus Fontoura, Suhas Sadanandan, Jayavel Shanmugasundaram, Sergei Vassilvitski, Erik Vee, Srihari Venkatesan, and Jason Zien. 2010. Efficiently evaluating complex boolean expressions. In Proceedings of the 2010 ACM SIGMOD International Conference on Management of data. 3\u201314."},{"key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/602259.602266","volume-title":"Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data","author":"Guttman Antonin","year":"1984","unstructured":"Antonin Guttman. 1984. R-trees: A dynamic index structure for spatial searching. In Proceedings of the 1984 ACM SIGMOD International Conference on Management of Data. 47\u201357."},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1109\/ICDE.1999.754942","volume-title":"Proceedings of the 15th International Conference on Data Engineering (Cat. No. 99CB36337)","author":"Hanson Eric N.","year":"1999","unstructured":"Eric N. Hanson, Chris Carnes, Lan Huang, Mohan Konyala, Lloyd Noronha, Sashi Parthasarathy, JB Park, and Albert Vernon. 1999. Scalable trigger processing. In Proceedings of the 15th International Conference on Data Engineering (Cat. No. 99CB36337). IEEE, 266\u2013275."},{"key":"e_1_3_2_23_2","first-page":"53","volume-title":"Proceedings of the 22nd International Conference on Data Engineering.","author":"Hou Shuang","year":"2006","unstructured":"Shuang Hou and H-A Jacobsen. 2006. Predicate-based filtering of XPath expressions. In Proceedings of the 22nd International Conference on Data Engineering.IEEE, 53\u201353."},{"key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"164","DOI":"10.4018\/978-1-60566-697-6.ch008","volume-title":"Proceedings of the Principles and Applications of Distributed Event-Based Systems","author":"Jacobsen Hans-Arno","year":"2010","unstructured":"Hans-Arno Jacobsen, Alex Cheung, Guoli Li, Balasubramaneyam Maniymaran, Vinod Muthusamy, and Reza Sherafat Kazemzadeh. 2010. The PADRES publish\/subscribe system. In Proceedings of the Principles and Applications of Distributed Event-Based Systems. IGI Global, 164\u2013205."},{"issue":"3","key":"e_1_3_2_25_2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.14778\/3291264.3291270","article-title":"PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads","volume":"12","author":"Ji Shuping","year":"2018","unstructured":"Shuping Ji and Hans-Arno Jacobsen. 2018. PS-tree-based efficient boolean expression matching for high-dimensional and dense workloads. Proceedings of the VLDB Endowment 12, 3 (2018), 251\u2013264.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_26_2","first-page":"817","volume-title":"Proceedings of the 2021 International Conference on Management of Data","author":"Ji Shuping","year":"2021","unstructured":"Shuping Ji and Hans-Arno Jacobsen. 2021. A-tree: A dynamic data structure for efficiently indexing arbitrary boolean expressions. In Proceedings of the 2021 International Conference on Management of Data. 817\u2013829."},{"key":"e_1_3_2_27_2","first-page":"13","volume-title":"Proceedings of the 16th Annual Middleware Conference","author":"Ji Shuping","year":"2015","unstructured":"Shuping Ji, Chunyang Ye, Jun Wei, and Hans-Arno Jacobsen. 2015. MERC: Match at edge and route intra\u2013cluster for content-based publish\/subscribe systems. In Proceedings of the 16th Annual Middleware Conference. 13\u201324."},{"key":"e_1_3_2_28_2","first-page":"627","volume-title":"Proceedings of the 2008 28th International Conference on Distributed Computing Systems","author":"Li Guoli","year":"2008","unstructured":"Guoli Li, Shuang Hou, and Hans-Arno Jacobsen. 2008. Routing of XML and XPath queries in data dissemination networks. In Proceedings of the 2008 28th International Conference on Distributed Computing Systems. IEEE, 627\u2013638."},{"issue":"1","key":"e_1_3_2_29_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1658373.1658375","article-title":"A distributed service-oriented architecture for business process execution","volume":"4","author":"Li Guoli","year":"2010","unstructured":"Guoli Li, Vinod Muthusamy, and Hans-Arno Jacobsen. 2010. A distributed service-oriented architecture for business process execution. ACM Transactions on the Web 4, 1 (2010), 1\u201333.","journal-title":"ACM Transactions on the Web"},{"key":"e_1_3_2_30_2","first-page":"1","volume-title":"Proceedings of the 48th International Conference on Parallel Processing","author":"Liao Zhengyu","year":"2019","unstructured":"Zhengyu Liao, Shiyou Qian, Jian Cao, Yanhua Cao, Guangtao Xue, Jiadi Yu, Yanmin Zhu, and Minglu Li. 2019. PhSIH: A lightweight parallelization of event matching in content-based pub\/sub systems. In Proceedings of the 48th International Conference on Parallel Processing. 1\u201310."},{"key":"e_1_3_2_31_2","first-page":"152","volume-title":"Proceedings of the International Conference on Algorithms and Architectures for Parallel Processing","author":"Liao Zhengyu","year":"2021","unstructured":"Zhengyu Liao, Shiyou Qian, Zhonglong Zheng, Jian Cao, Guangtao Xue, and Minglu Li. 2021. BMTP: Combining backward matching with tree-based pruning for large-scale content-based pub\/sub systems. In Proceedings of the International Conference on Algorithms and Architectures for Parallel Processing. Springer, 152\u2013166."},{"issue":"4","key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/BF01231606","article-title":"The TV-tree: An index structure for high-dimensional data","volume":"3","author":"Lin King-Ip","year":"1994","unstructured":"King-Ip Lin, Hosagrahar V. Jagadish, and Christos Faloutsos. 1994. The TV-tree: An index structure for high-dimensional data. The VLDB Journal 3, 4 (1994), 517\u2013542.","journal-title":"The VLDB Journal"},{"key":"e_1_3_2_33_2","first-page":"3","volume-title":"Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement","author":"Liu Hongzhou","year":"2005","unstructured":"Hongzhou Liu, Venugopalan Ramasubramanian, and Emin G\u00fcn Sirer. 2005. Client behavior and feed characteristics of RSS, a publish-subscribe system for web micronews. In Proceedings of the 5th ACM SIGCOMM Conference on Internet Measurement. 3\u20133."},{"issue":"1","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"451","DOI":"10.14778\/1453856.1453906","article-title":"Scalable ranked publish\/subscribe","volume":"1","author":"Machanavajjhala Ashwin","year":"2008","unstructured":"Ashwin Machanavajjhala, Erik Vee, Minos Garofalakis, and Jayavel Shanmugasundaram. 2008. Scalable ranked publish\/subscribe. Proceedings of the VLDB Endowment 1, 1 (2008), 451\u2013462.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/2002259.2002285","volume-title":"Proceedings of the 5th ACM International Conference on Distributed Event-based System","author":"Margara Alessandro","year":"2011","unstructured":"Alessandro Margara and Gianpaolo Cugola. 2011. High performance content-based matching using GPUs. In Proceedings of the 5th ACM International Conference on Distributed Event-based System. 183\u2013194."},{"issue":"1","key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/TPDS.2013.39","article-title":"High-performance publish-subscribe matching using parallel hardware","volume":"25","author":"Margara Alessandro","year":"2013","unstructured":"Alessandro Margara and Gianpaolo Cugola. 2013. High-performance publish-subscribe matching using parallel hardware. IEEE Transactions on Parallel and Distributed Systems 25, 1 (2013), 126\u2013135.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"4","key":"e_1_3_2_37_2","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"PATRICIA\u2013practical algorithm to retrieve information coded in alphanumeric","volume":"15","author":"Morrison Donald R.","year":"1968","unstructured":"Donald R. Morrison. 1968. PATRICIA\u2013practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM 15, 4 (1968), 514\u2013534.","journal-title":"Journal of the ACM"},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"2058","DOI":"10.1109\/INFOCOM.2014.6848147","volume-title":"Proceedings of the IEEE INFOCOM 2014-IEEE Conference on Computer Communications","author":"Qian Shiyou","year":"2014","unstructured":"Shiyou Qian, Jian Cao, Yanmin Zhu, and Minglu Li. 2014. REIN: A fast event matching approach for content-based publish\/subscribe systems. In Proceedings of the IEEE INFOCOM 2014-IEEE Conference on Computer Communications. IEEE, 2058\u20132066."},{"issue":"6","key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"1622","DOI":"10.1109\/TPDS.2014.2323262","article-title":"H-tree: An efficient index structurefor event matching in content-basedpublish\/subscribe systems","volume":"26","author":"Qian Shiyou","year":"2014","unstructured":"Shiyou Qian, Jian Cao, Yanmin Zhu, Minglu Li, and Jie Wang. 2014. H-tree: An efficient index structurefor event matching in content-basedpublish\/subscribe systems. IEEE Transactions on Parallel and Distributed Systems 26, 6 (2014), 1622\u20131632.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/978-3-030-85928-2_43","volume-title":"Wireless Algorithms, Systems, and Applications: 16th International Conference, WASA 2021, Nanjing, China, June 25\u201327, 2021, Proceedings, Part I 16","author":"Qian Shiyou","year":"2021","unstructured":"Shiyou Qian, Jiawei Xu, Jian Cao, Guangtao Xue, Junshen Li, and Wenyi Zhang. 2021. Fat topic: Improving latency in content-based publish\/subscribe systems on apache kafka. In Wireless Algorithms, Systems, and Applications: 16th International Conference, WASA 2021, Nanjing, China, June 25\u201327, 2021, Proceedings, Part I 16. Springer, 547\u2013558."},{"key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/1951365.1951374","volume-title":"Proceedings of the 14th International Conference on Extending Database Technology","author":"Sadoghi Mohammad","year":"2011","unstructured":"Mohammad Sadoghi, Ioana Burcea, and Hans-Arno Jacobsen. 2011. GPX-Matcher: A generic boolean predicate-based XPath expression matcher. In Proceedings of the 14th International Conference on Extending Database Technology. 45\u201356."},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/1989323.1989390","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of data","author":"Sadoghi Mohammad","year":"2011","unstructured":"Mohammad Sadoghi and Hans-Arno Jacobsen. 2011. Be-tree: An index structure to efficiently match boolean expressions over high-dimensional discrete space. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. 637\u2013648."},{"issue":"2","key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2487259.2487260","article-title":"Analysis and optimization for boolean expression indexing","volume":"38","author":"Sadoghi Mohammad","year":"2013","unstructured":"Mohammad Sadoghi and Hans-Arno Jacobsen. 2013. Analysis and optimization for boolean expression indexing. ACM Transactions on Database Systems 38, 2 (2013), 1\u201347.","journal-title":"ACM Transactions on Database Systems"},{"key":"e_1_3_2_44_2","first-page":"364","volume-title":"Proceedings of the 2014 IEEE 30th International Conference on Data Engineering","author":"Sadoghi Mohammad","year":"2014","unstructured":"Mohammad Sadoghi and Hans-Arno Jacobsen. 2014. Adaptive parallel compressed event matching. In Proceedings of the 2014 IEEE 30th International Conference on Data Engineering. IEEE, 364\u2013375."},{"issue":"10","key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"2824","DOI":"10.1109\/TKDE.2015.2421331","article-title":"Safe distribution and parallel execution of data-centric workflows over the publish\/subscribe abstraction","volume":"27","author":"Sadoghi Mohammad","year":"2015","unstructured":"Mohammad Sadoghi, Martin Jergler, Hans-Arno Jacobsen, Richard Hull, and Roman Vaculin. 2015. Safe distribution and parallel execution of data-centric workflows over the publish\/subscribe abstraction. IEEE Transactions on Knowledge and Data Engineering 27, 10 (2015), 2824\u20132838.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_46_2","first-page":"277","volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications","author":"Shi Wanghua","year":"2022","unstructured":"Wanghua Shi and Shiyou Qian. 2022. HEM: A hardware-aware event matching algorithm for content-based pub\/sub systems. In Proceedings of the International Conference on Database Systems for Advanced Applications. Springer, 277\u2013292."},{"key":"e_1_3_2_47_2","unstructured":"SIGMOD. 2013. ACM SIGMOD 2013 programming contest. Retrieved October 01 2024 from http:\/\/sigmod.kaust.edu.sa"},{"key":"e_1_3_2_48_2","first-page":"1","volume-title":"Proceedings of the 14th Annual Symposium on Switching and Automata Theory.","author":"Weiner Peter","year":"1973","unstructured":"Peter Weiner. 1973. Linear pattern matching algorithms. In Proceedings of the 14th Annual Symposium on Switching and Automata Theory.IEEE, 1\u201311."},{"issue":"1","key":"e_1_3_2_49_2","first-page":"37","article-title":"Indexing boolean expressions","volume":"2","author":"Whang Steven Euijong","year":"2009","unstructured":"Steven Euijong Whang, Hector Garcia-Molina, Chad Brower, Jayavel Shanmugasundaram, Sergei Vassilvitskii, Erik Vee, and Ramana Yerneni. 2009. Indexing boolean expressions. PVLDB 2, 1 (2009), 37\u201348.","journal-title":"PVLDB"},{"issue":"8","key":"e_1_3_2_50_2","doi-asserted-by":"crossref","first-page":"613","DOI":"10.14778\/2732296.2732298","article-title":"An efficient publish\/subscribe index for e-commerce databases","volume":"7","author":"Zhang Dongxiang","year":"2014","unstructured":"Dongxiang Zhang, Chee-Yong Chan, and Kian-Lee Tan. 2014. An efficient publish\/subscribe index for e-commerce databases. Proceedings of the VLDB Endowment 7, 8 (2014), 613\u2013624.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_51_2","first-page":"790","volume-title":"Proceedings of the 2011 31st International Conference on Distributed Computing Systems","author":"Zhao Yaxiong","year":"2011","unstructured":"Yaxiong Zhao and Jie Wu. 2011. Towards approximate event processing in a large-scale content-based network. In Proceedings of the 2011 31st International Conference on Distributed Computing Systems. IEEE, 790\u2013799."},{"key":"e_1_3_2_52_2","first-page":"106","volume-title":"Proceedings of the SEKE","author":"Zhu Weidong","year":"2022","unstructured":"Weidong Zhu, Yufeng Deng, Shiyou Qian, Jian Cao, and Guangtao Xue. 2022. PEM: A parallel ensemble matching framework for content-based publish\/subscribe systems. In Proceedings of the SEKE. 106\u2013111."},{"issue":"17","key":"e_1_3_2_53_2","doi-asserted-by":"crossref","first-page":"e6640","DOI":"10.1002\/cpe.6640","article-title":"Lap: A latency-aware parallelism framework for content-based publish\/subscribe systems","volume":"35","author":"Zhu Weidong","year":"2023","unstructured":"Weidong Zhu, Shiyou Qian, Jiawei Xu, Guangtao Xue, Jian Cao, Yanmin Zhu, and Wenjuan Li. 2023. Lap: A latency-aware parallelism framework for content-based publish\/subscribe systems. Concurrency and Computation: Practice and Experience 35, 17 (2023), e6640.","journal-title":"Concurrency and Computation: Practice and Experience"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3736756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T12:28:36Z","timestamp":1753360116000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3736756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,24]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12,31]]}},"alternative-id":["10.1145\/3736756"],"URL":"https:\/\/doi.org\/10.1145\/3736756","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7,24]]},"assertion":[{"value":"2023-10-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-05-01","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}