{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T11:01:31Z","timestamp":1780743691270,"version":"3.54.1"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T00:00:00Z","timestamp":1739145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,2,10]]},"abstract":"<jats:p>The continuous evaluation of queries over an event stream provides the foundation for reactive applications in various domains. Yet, knowledge of queries that detect distinguished event patterns that are potential causes of the situation of interest is often not directly available. However, given a database of finite, historic (sub-)streams that have been gathered whenever a situation of interest was observed, one may aim at automatic discovery of the respective queries. Existing algorithms for event query discovery incorporate ad-hoc design choices, though, and it is unclear how their suitability for a database shall be assessed.<\/jats:p>\n                  <jats:p>In this paper, we address this gap with DISCES, an algorithmic framework for event query discovery. DISCES outlines a design space for discovery algorithms, thereby making the design choices explicit. We instantiate the framework to derive four specific algorithms, which all yield correct and complete results, but differ in their runtime sensitivity. We therefore also provide guidance on how to select one of the algorithms for a given database based on a few of its essential properties. Our experiments using simulated and real-world data illustrate that our algorithms are indeed tailored to databases showing certain properties and solve the query discovery problem several orders of magnitude faster than existing approaches.<\/jats:p>","DOI":"10.1145\/3709682","type":"journal-article","created":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T15:45:06Z","timestamp":1739288706000},"page":"1-26","source":"Crossref","is-referenced-by-count":4,"title":["DISCES: Systematic Discovery of Event Stream Queries"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7342-7131","authenticated-orcid":false,"given":"Rebecca","family":"Sattler","sequence":"first","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4133-7975","authenticated-orcid":false,"given":"Sarah","family":"Kleest-Mei\u00dfner","sequence":"additional","affiliation":[{"name":"Humboldt-Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7217-8188","authenticated-orcid":false,"given":"Steven","family":"Lange","sequence":"additional","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5137-1504","authenticated-orcid":false,"given":"Markus L.","family":"Schmid","sequence":"additional","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5705-1675","authenticated-orcid":false,"given":"Nicole","family":"Schweikardt","sequence":"additional","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3325-7227","authenticated-orcid":false,"given":"Matthias","family":"Weidlich","sequence":"additional","affiliation":[{"name":"Humboldt Universit\u00e4t zu Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,2,11]]},"reference":[{"key":"e_1_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645480.655281"},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-004-0147-z"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093742.3095106"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2014.77"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2757217"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.346"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187671.2187677"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.ISAAC.2022.64"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2335484.2335496"},{"key":"e_1_2_2_10_1","unstructured":"EODData. 2015. NASDAQ Intra-Day Data. https:\/\/eoddata.com\/. Accessed: 2015-09--27."},{"key":"e_1_2_2_11_1","volume-title":"Tseng","author":"Fournier-Viger Philippe","year":"2014","unstructured":"Philippe Fournier-Viger, Cheng-Wei Wu, Antonio Gomariz, and Vincent S. Tseng. 2014. VMSP: Efficient Vertical Mining of Maximal Sequential Patterns. In Advances in Artificial Intelligence, Marina Sokolova and Peter van Beek (Eds.). Springer International Publishing, Cham, 83--94."},{"key":"e_1_2_2_12_1","volume-title":"Tseng","author":"Fournier-Viger Philippe","year":"2013","unstructured":"Philippe Fournier-Viger, Cheng-Wei Wu, and Vincent S. Tseng. 2013. Mining Maximal Sequential Patterns without Candidate Maintenance. In Advanced Data Mining and Applications, Hiroshi Motoda, Zhaohui Wu, Longbing Cao, Osmar Zaiane, Min Yao, and Wei Wang (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 169--180."},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015270.3015273"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00557-w"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICDT.2022.18"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.18420\/BTW2023--24"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2018.12.009"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.367.2"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452804"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1329"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1824795.1824798"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611286.2611289"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093742.3093917"},{"key":"e_1_2_2_24_1","unstructured":"Spiros Papadimitriou Jimeng Sun and Christos Faloutsos. 2005. Streaming pattern discovery in multiple time-series. (2005)."},{"key":"e_1_2_2_25_1","first-page":"1","article-title":"Towards understanding heterogeneous clouds at scale: Google trace analysis. Intel Science and Technology Center for Cloud Computing","volume":"84","author":"Reiss Charles","year":"2012","unstructured":"Charles Reiss, Alexey Tumanov, Gregory R Ganger, Randy H Katz, and Michael A Kozuch. 2012. Towards understanding heterogeneous clouds at scale: Google trace analysis. Intel Science and Technology Center for Cloud Computing, Tech. Rep, Vol. 84 (2012), 1--12.","journal-title":"Tech. Rep"},{"key":"e_1_2_2_26_1","first-page":"1","article-title":"Google cluster-usage traces: format schema","volume":"1","author":"Reiss Charles","year":"2011","unstructured":"Charles Reiss, John Wilkes, and Joseph L Hellerstein. 2011. Google cluster-usage traces: format schema. Google Inc., White Paper, Vol. 1 (2011), 1--14.","journal-title":"Google Inc., White Paper"},{"key":"e_1_2_2_27_1","volume-title":"DISCES: Systematic Discovery of Event Stream Queries -- Technical Report. Technical Report. https:\/\/github.com\/rebesatt\/disces","author":"Sattler Rebecca","year":"2024","unstructured":"Rebecca Sattler, Sarah Kleest-Mei\u00dfner, Steven Lange, Markus L. Schmid, Nicole Schweikardt, and Matthias Weidlich. 2024. DISCES: Systematic Discovery of Event Stream Queries -- Technical Report. Technical Report. https:\/\/github.com\/rebesatt\/disces"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933271"},{"key":"e_1_2_2_29_1","volume-title":"Feyza Yildirim Okay, and Suat Ozdemir","author":"Simsek Mehmet Ulvi","year":"2021","unstructured":"Mehmet Ulvi Simsek, Feyza Yildirim Okay, and Suat Ozdemir. 2021. A deep learning-based CEP rule extraction framework for IoT data. The Journal of Supercomputing (2021), 1--30."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-012-0289-3"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1319986"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972733.15"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593671"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709682","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3709682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:23:20Z","timestamp":1774981400000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3709682"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,10]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2,10]]}},"alternative-id":["10.1145\/3709682"],"URL":"https:\/\/doi.org\/10.1145\/3709682","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,2,10]]}}}