{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:59:29Z","timestamp":1774979969901,"version":"3.50.1"},"reference-count":145,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T00:00:00Z","timestamp":1727654400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62322213"],"award-info":[{"award-number":["62322213"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,10,1]]},"abstract":"<jats:p>&gt;Sampling is one of the most widely employed approximations in big data processing. Among various challenges in sampling design, sampling for join is particularly intriguing yet complex. This perplexing problem starts with a classical case where the join of two Bernoulli samples shrinks its output size quadratically and exhibits a strong dependency on the input data, presenting a unique challenge that necessitates adaptive sampling to guarantee both the quantity and quality of the sampled data. The community has made strides in achieving this goal by constructing offline samples and integrating support from indexes or key frequencies. However, when dealing with stream data, due to the need for real-time processing and high-quality analysis, methods developed for processing static data become unavailable. Consequently, a fundamental question arises: Is it possible to achieve adaptive sampling in stream data without relying on offline techniques?<\/jats:p>\n                  <jats:p>To address this problem, we propose FreeSam, which couples hybrid sampling with intra-window join, a key stream join operator. Our focus lies on two widely used metrics: output size, ensuring quantity, and variance, ensuring quality. FreeSam enables adaptability in both the desired quantity and quality of data sampling by offering control on the two-dimensional space spanned by these metrics. Meanwhile, adjustable trade-offs between quality and performance make FreeSam practical for use. Our experiments show that, for every 1% increase in latency limitation, FreeSam can yield a 3.83% increase in the output size while maintaining the level of the estimator's variance. Additionally, we give FreeSam a multi-core implementation and ensure predictability of its latency through both an analytic model and a neural network model. The accuracy of these models is 88.05% and 96.75% respectively.<\/jats:p>","DOI":"10.1145\/3677134","type":"journal-article","created":{"date-parts":[[2024,9,30]],"date-time":"2024-09-30T17:41:44Z","timestamp":1727718104000},"page":"1-31","source":"Crossref","is-referenced-by-count":1,"title":["Enabling Adaptive Sampling for Intra-Window Join: Simultaneously Optimizing Quantity and Quality"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1344-579X","authenticated-orcid":false,"given":"Xilin","family":"Tang","sequence":"first","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1983-7321","authenticated-orcid":false,"given":"Feng","family":"Zhang","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9927-6925","authenticated-orcid":false,"given":"Shuhao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, SG"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8933-6787","authenticated-orcid":false,"given":"Yani","family":"Liu","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8618-4581","authenticated-orcid":false,"given":"Bingsheng","family":"He","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, SG"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5757-9135","authenticated-orcid":false,"given":"Xiaoyong","family":"Du","sequence":"additional","affiliation":[{"name":"Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,9,30]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"Sampling: Design and Analysis. Technometrics","year":"2000","unstructured":"2000. Sampling: Design and Analysis. Technometrics (2000)."},{"key":"e_1_2_2_2_1","volume-title":"Retrieved","year":"2022","unstructured":"2018. Interval Join in Apache Flink. Retrieved March 19, 2022 from https:\/\/nightlies.apache.org\/flink\/flink-docsrelease- 1.14\/docs\/dev\/datastream\/operators\/joining\/"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-003-0095-z"},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1155\/2021\/4811018"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304207"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/1182635.1164180"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.3390\/s21113876"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","unstructured":"Jieliang Ang Tianyuan Fu Johns Paul Shuhao Zhang Bingsheng He Teddy Wenceslao and Sien Tan. 2019. TraV: An Interactive Exploration System for Massive Trajectory Data. 309--313. https:\/\/doi.org\/10.1109\/BigMM.2019.000--4","DOI":"10.1109\/BigMM.2019.000--4"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/110859440"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594538.2594558"},{"key":"e_1_2_2_14_1","volume-title":"Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data","author":"Blanas Spyros","year":"1989","unstructured":"Spyros Blanas, Yinan Li, and Jignesh M. Patel. 2011. Design and Evaluation of Main Memory Hash Join Algorithms for Multi-Core CPUs. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data (Athens, Greece) (SIGMOD '11). Association for Computing Machinery, New York, NY, USA, 37--48. https:\/\/doi.org\/10.1145\/ 1989323.1989328"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319894"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/304181.304206"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035921"},{"key":"e_1_2_2_19_1","volume-title":"Random Sampling and Size Estimation Over Cyclic Joins. In International Conference on Database Theory.","author":"Chen Y.","year":"2020","unstructured":"Y. Chen and Ke Yi. 2020. Random Sampling and Size Estimation Over Cyclic Joins. In International Conference on Database Theory."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409501.3409536"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085504.3085514"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454171"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00262"},{"key":"e_1_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Graham Cormode Minos Garofalakis Peter J. Haas and Chris Jermaine. 2011. Synopses for Massive Data: Samples Histograms Wavelets Sketches.","DOI":"10.1561\/9781601985170"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11687238_4"},{"key":"e_1_2_2_26_1","first-page":"29","article-title":"An improved data stream summary: The Count-Min sketch and its applications","volume":"55","author":"Cormode Graham","year":"2004","unstructured":"Graham Cormode and S. Muthukrishnan. 2004. An improved data stream summary: The Count-Min sketch and its applications. J. Algorithms 55 (2004), 29--38.","journal-title":"J. Algorithms"},{"key":"e_1_2_2_27_1","volume-title":"Retrieved","author":"Croft James","year":"2024","unstructured":"James Croft. 2024. Identifying drift in ML models: Best practices for generating consistent, reliable responses. Retrieved April, 2024 from https:\/\/techcommunity.microsoft.com\/t5\/fasttrack-for-azure\/identifying-drift-in-ml-models-bestpractices- for-generating\/ba-p\/4040531"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","unstructured":"Abhinandan Das Johannes Gehrke and Mirek Riedewald. 2003. Approximate join processing over data streams. (2003) 40. https:\/\/doi.org\/10.1145\/872763.872765","DOI":"10.1145\/872763.872765"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.17"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588666"},{"key":"e_1_2_2_31_1","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases","author":"Dittrich Jens-Peter","year":"2002","unstructured":"Jens-Peter Dittrich, Bernhard Seeger, David Scot Taylor, and Peter Widmayer. 2002. Progressive Merge Join: A Generic and Non-Blocking Sort-Based Join Algorithm. In Proceedings of the 28th International Conference on Very Large Data Bases (Hong Kong, China) (VLDB '02). VLDB Endowment, 299--310."},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1860702.1860709"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3-"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.11.003"},{"key":"e_1_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732279.2732281"},{"key":"e_1_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.61"},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526165"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10745-0_33"},{"key":"e_1_2_2_39_1","unstructured":"Flink. 2022. \"Package org.apache.flink.api.java.sampling\". https:\/\/nightlies.apache.org\/flink\/flink-docs-master\/api\/ java\/org\/apache\/flink\/api\/java\/sampling\/package-summary.html"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/235968.233340"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0116-z"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.190630"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367899"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588716"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24741-8_41"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403144"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3625054.3625059"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081884"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132863.1132873"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933267.2933519"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--28608-0_2"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007601"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.3334\/CDIAC\/cli.ndp026b"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503586"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2017EDP7300"},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1952.10483446"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3034786.3056110"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3372716.3372726"},{"key":"e_1_2_2_60_1","volume-title":"LLMTune: Accelerate Database Knob Tuning with Large Language Models. arXiv preprint arXiv:2404.11581","author":"Huang Xinmei","year":"2024","unstructured":"Xinmei Huang, Haoyang Li, Jing Zhang, Xinxin Zhao, Zhiming Yao, Yiyan Li, Zhuohao Yu, Tieying Zhang, Hong Chen, and Cuiping Li. 2024. LLMTune: Accelerate Database Knob Tuning with Large Language Models. arXiv preprint arXiv:2404.11581 (2024)."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2017.11.440"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247560"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498265"},{"key":"e_1_2_2_64_1","first-page":"3","article-title":"Improvement design for distributed real-time stream processing systems","volume":"17","author":"Jiang Wei","year":"2019","unstructured":"Wei Jiang, Liu-Gen Xu, Hai-Bo Hu, and Yue Ma. 2019. Improvement design for distributed real-time stream processing systems. Journal of Electronic Science and Technology 17, 1 (2019), 3--12.","journal-title":"Journal of Electronic Science and Technology"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3221989"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066159"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.576785"},{"key":"e_1_2_2_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882940"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260804"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00169"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319869"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-020-00149-7"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093754.3093763"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.14778\/3297753.3297757"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2746485"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1050"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS"},{"key":"e_1_2_2_81_1","unstructured":"Tianyu Liu and Chi Wang. 2020. Understanding the hardness of approximate query processing with joins. arXiv:2010.00307 [cs.DB]"},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517911"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517871"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2010.10.002"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167--6423(82)90012-0"},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2006.52"},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056098"},{"key":"e_1_2_2_88_1","volume-title":"Proceedings of the 2016 USENIX Conference on Usenix Annual Technical Conference (Denver, CO, USA) (USENIX ATC '16). USENIX Association, USA, 493--505","author":"Najafi Mohammadreza","year":"2016","unstructured":"Mohammadreza Najafi, Mohammad Sadoghi, and Hans-Arno Jacobsen. 2016. SplitJoin: A Scalable, Low-Latency Stream Join Architecture with Adjustable Ordering Precision. In Proceedings of the 2016 USENIX Conference on Usenix Annual Technical Conference (Denver, CO, USA) (USENIX ATC '16). USENIX Association, USA, 493--505."},{"key":"e_1_2_2_89_1","volume-title":"Retrieved","author":"Angry Creator","year":"2022","unstructured":"Creator of the Angry Birds game. 2022. Flink. Retrieved March 19, 2022 from https:\/\/nightlies.apache.org\/flink\/flinkdocs- release-1.14\/"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183635"},{"key":"e_1_2_2_91_1","volume-title":"Random sampling from databases. thesis UC Berkeley","author":"Olken Frank","year":"1993","unstructured":"Frank Olken. 1993. Random sampling from databases. thesis UC Berkeley (1993), 172. http:\/\/www.cs.washington.edu\/ education\/courses\/cse590q\/05au\/papers\/Olken-Sampling.pdf"},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.2307\/1468251"},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402748"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517900"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3520161"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777599"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665852"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2019.76"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/3135974.3135989"},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.151"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882948"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732939.2732944"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1145\/1386118.1386121"},{"key":"e_1_2_2_104_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533737.3535095"},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589319"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2018.05.020"},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457302"},{"key":"e_1_2_2_108_1","volume-title":"Ali Mohammadi Shanghooshabad, and Qingzhi Ma","author":"Shekelyan Michael","year":"2022","unstructured":"Michael Shekelyan, Graham Cormode, Peter Triantafillou, Ali Mohammadi Shanghooshabad, and Qingzhi Ma. 2022. Weighted Random Sampling over Joins. CoRR abs\/2201.02670 (2022). arXiv:2201.02670 https:\/\/arxiv.org\/abs\/2201.02670"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20800"},{"key":"e_1_2_2_110_1","unstructured":"Spark. 2022. \"Java API for random utilities in Spark \". https:\/\/spark.apache.org\/docs\/3.4.0\/api\/java\/org\/apache\/spark\/ util\/random\/"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065199"},{"key":"e_1_2_2_112_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50031-0"},{"key":"e_1_2_2_113_1","volume-title":"An asymptotically optimal, online algorithm for weighted random sampling with replacement. ArXiv abs\/1611.00532","author":"Startek Michal","year":"2016","unstructured":"Michal Startek. 2016. An asymptotically optimal, online algorithm for weighted random sampling with replacement. ArXiv abs\/1611.00532 (2016)."},{"key":"e_1_2_2_114_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956792508007341"},{"key":"e_1_2_2_115_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250588"},{"key":"e_1_2_2_116_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989389"},{"key":"e_1_2_2_117_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588709"},{"key":"e_1_2_2_118_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526122"},{"key":"e_1_2_2_119_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452811"},{"key":"e_1_2_2_120_1","doi-asserted-by":"publisher","DOI":"10.1145\/1353343.1353414"},{"key":"e_1_2_2_121_1","volume-title":"Efficient Window Aggregation with General Stream Slicing. In International Conference on Extending Database Technology.","author":"Traub Jonas","year":"2019","unstructured":"Jonas Traub, Philipp Marian Grulich, Alejandro Rodriguez Cuellar, Sebastian Bre\u00df, Asterios Katsifodimos, Tilmann Rabl, and Volker Markl. 2019. Efficient Window Aggregation with General Stream Slicing. In International Conference on Extending Database Technology."},{"key":"e_1_2_2_122_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824051"},{"key":"e_1_2_2_123_1","doi-asserted-by":"publisher","DOI":"10.1145\/3147.3165"},{"key":"e_1_2_2_124_1","unstructured":"Martha Vlachou-Konchylaki. 2016. Efficient Data Stream Sampling on Apache Flink."},{"key":"e_1_2_2_125_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588935"},{"key":"e_1_2_2_126_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00263"},{"key":"e_1_2_2_127_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.07.047"},{"key":"e_1_2_2_128_1","unstructured":"A.N. Wilschut and P.M.G. Apers. 1991. Dataflow query execution in a parallel main-memory environment. In"},{"key":"e_1_2_2_129_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDIS.1991.183069"},{"key":"e_1_2_2_130_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588951"},{"key":"e_1_2_2_131_1","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Xu Le","year":"2021","unstructured":"Le Xu, Shivaram Venkataraman, Indranil Gupta, Luo Mai, and Rahul Potharaju. 2021. Move fast and meet deadlines: Fine-grained real-time stream processing with cameo. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21). 389--405."},{"key":"e_1_2_2_132_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02831750"},{"key":"e_1_2_2_133_1","unstructured":"Zongheng Yang and Chenggang Wu. \"2019\". \"Github repository: naru project\". https:\/\/github.com\/naru-project\/naru"},{"key":"e_1_2_2_134_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11269-013-0502-1"},{"key":"e_1_2_2_135_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0519--9"},{"key":"e_1_2_2_136_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588579"},{"key":"e_1_2_2_137_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3093234"},{"key":"e_1_2_2_138_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196931"},{"key":"e_1_2_2_139_1","doi-asserted-by":"publisher","DOI":"10.1145\/3654954"},{"key":"e_1_2_2_140_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588728"},{"key":"e_1_2_2_141_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452793"},{"key":"e_1_2_2_142_1","doi-asserted-by":"publisher","DOI":"10.1145\/3385658.3385662"},{"key":"e_1_2_2_143_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT.2007.246"},{"key":"e_1_2_2_144_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457304"},{"key":"e_1_2_2_145_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183739"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3677134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T17:10:23Z","timestamp":1774977023000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3677134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,30]]},"references-count":145,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,10,1]]}},"alternative-id":["10.1145\/3677134"],"URL":"https:\/\/doi.org\/10.1145\/3677134","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,9,30]]}}}