{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:23:22Z","timestamp":1773887002735,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,6,20]],"date-time":"2021-06-20T00:00:00Z","timestamp":1624147200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004281","name":"Narodowe Centrum Nauki","doi-asserted-by":"publisher","award":["2018\/30\/E\/ST6\/00042"],"award-info":[{"award-number":["2018\/30\/E\/ST6\/00042"]}],"id":[{"id":"10.13039\/501100004281","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,6,20]]},"DOI":"10.1145\/3452021.3458320","type":"proceedings-article","created":{"date-parts":[[2021,6,18]],"date-time":"2021-06-18T14:21:58Z","timestamp":1624026118000},"page":"109-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Stackless Processing of Streamed Trees"],"prefix":"10.1145","author":[{"given":"Corentin","family":"Barloy","sequence":"first","affiliation":[{"name":"ENS de Paris, Paris, France"}]},{"given":"Filip","family":"Murlak","sequence":"additional","affiliation":[{"name":"University of Warsaw, Warsaw, Poland"}]},{"given":"Charles","family":"Paperman","sequence":"additional","affiliation":[{"name":"University of Lille, INRIA LINKS & CRIStAL CNRS, Lille, France"}]}],"member":"320","published-online":{"date-parts":[[2021,6,20]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"420","volume-title":"Proc. STACS 2006","author":"Vince","year":"2006","unstructured":"Vince B\u00e1 r\u00e1 ny, Christof L\u00f6 ding, and Olivier Serre. Regularity problems for visibly pushdown languages . In Proc. STACS 2006 , pages 420 -- 431 . Springer , 2006 . Vince B\u00e1 r\u00e1 ny, Christof L\u00f6 ding, and Olivier Serre. Regularity problems for visibly pushdown languages. In Proc. STACS 2006, pages 420--431. Springer, 2006."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(89)90052-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Angela Bonifati George H. L. Fletcher Hannes Voigt and Nikolay Yakovets. Querying Graphs. Morgan & Claypool Publishers 2018.  Angela Bonifati George H. L. Fletcher Hannes Voigt and Nikolay Yakovets. Querying Graphs. Morgan & Claypool Publishers 2018.","DOI":"10.1007\/978-3-031-01864-0"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23397-5_2"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017074.1017096"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.01.017"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90148-2"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2018.00069"},{"key":"e_1_3_2_1_9_1","first-page":"1","volume-title":"Proc. ICDT 2019","author":"Grez Alejandro","year":"2019","unstructured":"Alejandro Grez , Cristian Riveros , and Mart'i n Ugarte . A formal framework for complex event processing . In Proc. ICDT 2019 , pages 5: 1 -- 5 :18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik , 2019 . Alejandro Grez, Cristian Riveros, and Mart'i n Ugarte. A formal framework for complex event processing. In Proc. ICDT 2019, pages 5:1--5:18. Schloss Dagstuhl - Leibniz-Zentrum f\u00fc r Informatik, 2019."},{"key":"e_1_3_2_1_10_1","volume-title":"A comparison of regex engines","author":"Grunert Sascha","year":"2017","unstructured":"Sascha Grunert and Daniel Schmidt . A comparison of regex engines , 2017 . https:\/\/rust-leipzig.github.io\/regex\/2017\/03\/28\/comparison-of-regex-engines\/. Sascha Grunert and Daniel Schmidt. A comparison of regex engines, 2017. https:\/\/rust-leipzig.github.io\/regex\/2017\/03\/28\/comparison-of-regex-engines\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872809"},{"key":"e_1_3_2_1_12_1","first-page":"213","volume-title":"Proc. ICDT 2014","author":"He Yeye","year":"2014","unstructured":"Yeye He , Siddharth Barman , and Jeffrey F. Naughton . On load shedding in complex event processing . In Proc. ICDT 2014 , pages 213 -- 224 . OpenProceedings.org , 2014 . Yeye He, Siddharth Barman, and Jeffrey F. Naughton. On load shedding in complex event processing. In Proc. ICDT 2014, pages 213--224. OpenProceedings.org, 2014."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2933579"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00578-5"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902299"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00452-8"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1063"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/3236187.3236207"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10003-2_93"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0023844"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/576708"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2747645"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. IPDPS 2005","author":"Ren Gang","year":"2005","unstructured":"Gang Ren , Peng Wu , and David A. Padua . An empirical study on the vectorization of multimedia applications for multimedia extensions . In Proc. IPDPS 2005 . IEEE, 2005 . Gang Ren, Peng Wu, and David A. Padua. An empirical study on the vectorization of multimedia applications for multimedia extensions. In Proc. IPDPS 2005. IEEE, 2005."},{"key":"e_1_3_2_1_24_1","first-page":"299","volume-title":"Proc. ICDT 2007","author":"Segoufin Luc","year":"2007","unstructured":"Luc Segoufin and Cristina Sirangelo . Constant-memory validation of streaming XML documents against DTDs . In Proc. ICDT 2007 , pages 299 -- 313 . Springer , 2007 . Luc Segoufin and Cristina Sirangelo. Constant-memory validation of streaming XML documents against DTDs. In Proc. ICDT 2007, pages 299--313. Springer, 2007."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543622"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1570-8667(03)00063-7"},{"key":"e_1_3_2_1_27_1","volume-title":"Deep Learning and Unsupervised Feature Learning Workshop @ NIPS","author":"Vanhoucke Vincent","year":"2011","unstructured":"Vincent Vanhoucke , Andrew Senior , and Mark Z. Mao . Improving the speed of neural networks on CPUs, 2011 . Deep Learning and Unsupervised Feature Learning Workshop @ NIPS 2011 . Vincent Vanhoucke, Andrew Senior, and Mark Z. Mao. Improving the speed of neural networks on CPUs, 2011. Deep Learning and Unsupervised Feature Learning Workshop @ NIPS 2011."},{"key":"e_1_3_2_1_28_1","first-page":"40","volume-title":"Proc. FCT 1983","author":"Burchard","year":"1983","unstructured":"Burchard von Braunm\u00fc hl and Rutger Verbeek. Input-driven languages are recognized in log n space . In Proc. FCT 1983 , pages 40 -- 51 . Springer , 1983 . Burchard von Braunm\u00fc hl and Rutger Verbeek. Input-driven languages are recognized in log n space. In Proc. FCT 1983, pages 40--51. Springer, 1983."},{"key":"e_1_3_2_1_29_1","first-page":"631","volume-title":"Proc. NSDI 2019","author":"Wang Xiang","year":"2019","unstructured":"Xiang Wang , Yang Hong , Harry Chang , KyoungSoo Park , Geoff Langdale , Jiayu Hu , and Heqing Zhu . Hyperscan : A fast multi-pattern regex matcher for modern CPUs . In Proc. NSDI 2019 , pages 631 -- 648 . USENIX Association , 2019 . Xiang Wang, Yang Hong, Harry Chang, KyoungSoo Park, Geoff Langdale, Jiayu Hu, and Heqing Zhu. Hyperscan: A fast multi-pattern regex matcher for modern CPUs. In Proc. NSDI 2019, pages 631--648. USENIX Association, 2019."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593671"},{"key":"e_1_3_2_1_31_1","volume-title":"Regex engine matching speed benchmark","author":"Zhang Yichun","year":"2015","unstructured":"Yichun Zhang . Regex engine matching speed benchmark , 2015 . http:\/\/openresty.org\/misc\/re\/bench\/. Yichun Zhang. Regex engine matching speed benchmark, 2015. http:\/\/openresty.org\/misc\/re\/bench\/."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564709"}],"event":{"name":"SIGMOD\/PODS '21: International Conference on Management of Data","location":"Virtual Event China","acronym":"SIGMOD\/PODS '21","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458320","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452021.3458320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:03:00Z","timestamp":1750197780000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452021.3458320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,20]]},"references-count":32,"alternative-id":["10.1145\/3452021.3458320","10.1145\/3452021"],"URL":"https:\/\/doi.org\/10.1145\/3452021.3458320","relation":{},"subject":[],"published":{"date-parts":[[2021,6,20]]},"assertion":[{"value":"2021-06-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}