{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:34:04Z","timestamp":1781584444107,"version":"3.54.5"},"reference-count":93,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2023,6,13]],"date-time":"2023-06-13T00:00:00Z","timestamp":1686614400000},"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":[[2023,6,13]]},"abstract":"<jats:p>For exploratory data analysis, it is often desirable to know what answers you are likely to get before actually obtaining those answers. This can potentially be achieved by designing systems to offer the estimates of a data operation result-say op(data)-earlier in the process based on partial data processing. Those estimates continuously refine as more data is processed and finally converge to the exact answer. Unfortunately, the existing techniques-called Online Aggregation (OLA)-are limited to a single operation; that is, we cannot obtain the estimates for op(op(data)) or op(...(op(data))). If this Deep OLA becomes possible, data analysts will be able to explore data more interactively using complex cascade operations.<\/jats:p>\n          <jats:p>In this work, we take a step toward Deep OLA with evolving data frames (edf), a novel data model to offer OLA for nested ops-op(...(op(data)))-by representing an evolving structured data (with converging estimates) that is closed under set operations. That is, op(edf) produces yet another edf; thus, we can freely apply successive operations to edf and obtain an OLA output for each op. We evaluate its viability with Wake, an edf-based OLA system, by examining against state-of-the-art OLA and non-OLA systems. In our experiments on TPC-H dataset, Wake produces its first estimates 4.93\u00d7 faster (median)-with 1.3\u00d7 median slowdown for exact answers-compared to conventional systems. Besides its generality, Wake is also 1.92\u00d7 faster (median) than existing OLA systems in producing estimates of under 1% relative errors.<\/jats:p>","DOI":"10.1145\/3589269","type":"journal-article","created":{"date-parts":[[2023,6,20]],"date-time":"2023-06-20T20:26:45Z","timestamp":1687292805000},"page":"1-28","source":"Crossref","is-referenced-by-count":7,"title":["A Step Toward Deep Online Aggregation"],"prefix":"10.1145","volume":"1","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4533-826X","authenticated-orcid":false,"given":"Nikhil","family":"Sheoran","sequence":"first","affiliation":[{"name":"Databricks &amp; University of Illinois at Urbana-Champaign, Mountain View, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2881-8501","authenticated-orcid":false,"given":"Supawit","family":"Chockchowwat","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0882-2983","authenticated-orcid":false,"given":"Arav","family":"Chheda","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1385-8426","authenticated-orcid":false,"given":"Suwen","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-6773-5436","authenticated-orcid":false,"given":"Riya","family":"Verma","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3786-6214","authenticated-orcid":false,"given":"Yongjoo","family":"Park","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,20]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"Accessed: 2022--10-01. MySQL 8.0 Reference - FIND_IN_SET. https:\/\/dev.mysql.com\/doc\/refman\/8.0\/en\/string-functions.html#function_find-in-set."},{"key":"e_1_2_2_2_1","unstructured":"Accessed: 2022--10-01. MySQL 8.0 Reference - GROUP_CONCAT. https:\/\/dev.mysql.com\/doc\/refman\/8.0\/en\/aggregate-functions.html#function_group-concat."},{"key":"e_1_2_2_3_1","unstructured":"Accessed: 2022--10--15. Apache Arrow. https:\/\/arrow.apache.org\/."},{"key":"e_1_2_2_4_1","unstructured":"Accessed: 2022--10--15. Apache Parquet. https:\/\/parquet.apache.org\/."},{"key":"e_1_2_2_5_1","unstructured":"Accessed: 2022--10--15. ProgressiveDB. https:\/\/github.com\/DataManagementLab\/progressiveDB."},{"key":"e_1_2_2_6_1","unstructured":"Accessed: 2022--10--15. TPC-H: Decision Support Benchmark. https:\/\/www.tpc.org\/tpch\/."},{"key":"e_1_2_2_7_1","unstructured":"Accessed: 2022--10--15. XDB: approXimate DataBase (XDB). https:\/\/github.com\/InitialDLab\/XDB."},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465355"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/253262.253355"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687592"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872822"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407854"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352073"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/16856.16861"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2007.05.002"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/767141.767147"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242524.1242526"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056097"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056097"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380392"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807186"},{"key":"e_1_2_2_22_1","volume-title":"Automatically Finding Optimal Index Structure. arXiv preprint arXiv:2208.03823","author":"Chockchowwat Supawit","year":"2022","unstructured":"Supawit Chockchowwat, Wenjie Liu, and Yongjoo Park. 2022. Automatically Finding Optimal Index Structure. arXiv preprint arXiv:2208.03823 (2022)."},{"key":"e_1_2_2_23_1","volume-title":"Airphant: Cloud-oriented Document Indexing. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1368--1381","author":"Chockchowwat Supawit","year":"2022","unstructured":"Supawit Chockchowwat, Chaitanya Sood, and Yongjoo Park. 2022. Airphant: Cloud-oriented Document Indexing. In 2022 IEEE 38th International Conference on Data Engineering (ICDE). IEEE, 1368--1381."},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807295"},{"key":"e_1_2_2_25_1","volume-title":"Sketch techniques for approximate query processing. Foundations and Trends in Databases","author":"Cormode Graham","year":"2011","unstructured":"Graham Cormode. 2011. Sketch techniques for approximate query processing. Foundations and Trends in Databases. NOW publishers (2011), 15."},{"key":"e_1_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Graham Cormode Minos Garofalakis Peter J Haas Chris Jermaine et al. 2011. Synopses for massive data: Samples histograms wavelets sketches. Foundations and Trends\u00ae in Databases 4 1--3 (2011) 1--294.","DOI":"10.1561\/1900000004"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939502.2939513"},{"key":"e_1_2_2_28_1","volume-title":"Order statistics","author":"David Herbert A","unstructured":"Herbert A David and Haikady N Nagaraja. 2004. Order statistics. John Wiley & Sons."},{"key":"e_1_2_2_29_1","volume-title":"Proceedings of the 28th international conference on Very Large Data Bases. 299--310","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. 299--310."},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos"},{"key":"e_1_2_2_31_1","doi-asserted-by":"crossref","unstructured":"Philippe Flajolet \u00c9ric Fusy Olivier Gandouet and Fr\u00e9d\u00e9ric Meunier. 2007. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Discrete Mathematics and Theoretical Computer Science. Discrete Mathematics and Theoretical Computer Science 137--156.","DOI":"10.46298\/dmtcs.3545"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375706"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170066"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304208"},{"key":"e_1_2_2_35_1","unstructured":"Peter J. Haas Jeffrey F. Naughton S. Seshadri and Lynne Stokes. 1995. Sampling-Based Estimation of the Number of Distinct Values of an Attribute. In VLDB. Morgan Kaufmann 311--322."},{"key":"e_1_2_2_36_1","unstructured":"Fumio Hayashi. 2000. Econometrics. Princeton University Press. 27--32 pages."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193538"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/253260.253291"},{"key":"e_1_2_2_39_1","unstructured":"Ian Hellstr\u00f6m. Accessed: 2022--10-01. Oracle SQL & PL\/SQL Optimization for Developers. https:\/\/oracle.readthedocs.io\/en\/latest\/sql\/joins\/hash-join.html."},{"key":"e_1_2_2_40_1","volume-title":"Deepdb: Learn from data, not from queries! arXiv preprint arXiv:1909.00607","author":"Hilprecht Benjamin","year":"2019","unstructured":"Benjamin Hilprecht, Andreas Schmidt, Moritz Kulessa, Alejandro Molina, Kristian Kersting, and Carsten Binnig. 2019. Deepdb: Learn from data, not from queries! arXiv preprint arXiv:1909.00607 (2019)."},{"key":"e_1_2_2_41_1","first-page":"174","article-title":"Histogram-based approximation of set-valued query-answers","volume":"99","author":"Ioannidis Yannis E","year":"1999","unstructured":"Yannis E Ioannidis and Viswanath Poosala. 1999. Histogram-based approximation of set-valued query-answers. In VLDB, Vol. 99. 174--185.","journal-title":"VLDB"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412331.1412335"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1189769.1189775"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882940"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735479.2735485"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","unstructured":"Samuel Kotz and Saralees Nadarajah. 2000. Extreme Value Distributions. PUBLISHED BY IMPERIAL COLLEGE PRESS AND DISTRIBUTED BY WORLD SCIENTIFIC PUBLISHING CO. https:\/\/doi.org\/10.1142\/p191 arXiv:https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/p191","DOI":"10.1142\/p191"},{"key":"e_1_2_2_47_1","volume-title":"Section C: Engineering and Instrumentation","volume":"2","author":"Ku Harry H.","year":"2010","unstructured":"Harry H. Ku. 2010. Notes on the Use of Propagation of Error Formulas. In Journal of Research of the National Bureau of Standards, Section C: Engineering and Instrumentation, Vol. 2."},{"key":"e_1_2_2_48_1","volume-title":"The vertica analytic database: C-store 7 years later. arXiv preprint arXiv:1208.4173","author":"Lamb Andrew","year":"2012","unstructured":"Andrew Lamb, Matt Fuller, Ramakrishna Varadarajan, Nga Tran, Ben Vandier, Lyric Doshi, and Chuck Bear. 2012. The vertica analytic database: C-store 7 years later. arXiv preprint arXiv:1208.4173 (2012)."},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915235"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00393"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476254"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564721"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3324958"},{"key":"e_1_2_2_54_1","unstructured":"Wes McKinney et al. 2011. pandas: a foundational Python library for data analysis and statistics. Python for high performance and scientific computing 14 9 (2011) 1--9."},{"key":"e_1_2_2_55_1","volume-title":"Rebecca Isaacs, and Michael Isard.","author":"McSherry Frank","year":"2013","unstructured":"Frank McSherry, Derek Gordon Murray, Rebecca Isaacs, and Michael Isard. 2013. Differential Dataflow.. In CIDR."},{"key":"e_1_2_2_56_1","first-page":"13","volume-title":"S-Store: Streaming Meets Transaction Processing. Proceedings of the VLDB Endowment 8","author":"Meehan John","year":"2015","unstructured":"John Meehan, Nesime Tatbul, Stan Zdonik, Cansu Aslantas, Ugur Cetintemel, Jiang Du, Tim Kraska, Samuel Madden, David Maier, Andrew Pavlo, et al . 2015. S-Store: Streaming Meets Transaction Processing. Proceedings of the VLDB Endowment 8, 13 (2015)."},{"key":"e_1_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2004.1320002"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522738"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610519"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402748"},{"key":"e_1_2_2_61_1","volume-title":"Data synthesis based on generative adversarial networks. arXiv preprint arXiv:1806.03384","author":"Park Noseong","year":"2018","unstructured":"Noseong Park, Mahmoud Mohammadi, Kshitij Gorde, Sushil Jajodia, Hongkyu Park, and Youngmin Kim. 2018. Data synthesis based on generative adversarial networks. arXiv preprint arXiv:1806.03384 (2018)."},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850589"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498287"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196905"},{"key":"e_1_2_2_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3300077"},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064013"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389727"},{"key":"e_1_2_2_68_1","volume-title":"On estimation of a probability density function and mode. The annals of mathematical statistics 33, 3","author":"Parzen Emanuel","year":"1962","unstructured":"Emanuel Parzen. 1962. On estimation of a probability density function and mode. The annals of mathematical statistics 33, 3 (1962), 1065--1076."},{"key":"e_1_2_2_69_1","unstructured":"pola rs. Accessed: 2022--10--14. Polars: Lightning-fast DataFrame library for Rust and Python. https:\/\/www.pola.rs\/."},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206525"},{"key":"e_1_2_2_71_1","first-page":"5","article-title":"Approximate query answering using histograms","volume":"22","author":"Poosala Viswanath","year":"1999","unstructured":"Viswanath Poosala, Venkatesh Ganti, and Yannis E. Ioannidis. 1999. Approximate query answering using histograms. IEEE Data Eng. Bull. 22, 4 (1999), 5--14.","journal-title":"IEEE Data Eng. Bull."},{"key":"e_1_2_2_72_1","volume-title":"Remarks on some nonparametric estimates of a density function. The annals of mathematical statistics","author":"Rosenblatt Murray","year":"1956","unstructured":"Murray Rosenblatt. 1956. Remarks on some nonparametric estimates of a density function. The annals of mathematical statistics (1956), 832--837."},{"key":"e_1_2_2_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335393"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00196"},{"key":"e_1_2_2_75_1","volume-title":"A Step Toward Deep Online Aggregation (Extended Version). arXiv preprint arXiv:2303.04103","author":"Sheoran Nikhil","year":"2022","unstructured":"Nikhil Sheoran, Supawit Chockchowwat, Arav Chheda, Suwen Wang, Riya Verma, and Yongjoo Park. 2022. A Step Toward Deep Online Aggregation (Extended Version). arXiv preprint arXiv:2303.04103 (2022)."},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i8.20800"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398423"},{"key":"e_1_2_2_78_1","article-title":"Des valeurs moyennes (Traduction du russe, N. de Khanikof","author":"Tch\u00e9bychef P.","year":"1867","unstructured":"P. Tch\u00e9bychef. 1867. Des valeurs moyennes (Traduction du russe, N. de Khanikof. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es (1867), 177--184. http:\/\/eudml.org\/doc\/234989","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es (1867), 177--184. http:\/\/eudml.org\/doc\/234989"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00117"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2595641"},{"key":"e_1_2_2_81_1","volume-title":"XJoin: A Reactively-Scheduled Pipelined Join Operator. Bulletin of the Technical Committee on","author":"Urhan Tolga","year":"2000","unstructured":"Tolga Urhan and Michael J Franklin. 2000. XJoin: A Reactively-Scheduled Pipelined Join Operator. Bulletin of the Technical Committee on (2000), 27."},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511802256"},{"key":"e_1_2_2_83_1","volume-title":"Are we ready for learned cardinality estimation? arXiv preprint arXiv:2012.06743","author":"Wang Xiaoying","year":"2020","unstructured":"Xiaoying Wang, Changbo Qu, Weiyuan Wu, Jiannan Wang, and Qingqing Zhou. 2020. Are we ready for learned cardinality estimation? arXiv preprint arXiv:2012.06743 (2020)."},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687678"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807238"},{"key":"e_1_2_2_86_1","unstructured":"Lei Xu Maria Skoularidou Alfredo Cuesta-Infante and Kalyan Veeramachaneni. 2019. Modeling Tabular data using Conditional GAN. In Advances in Neural Information Processing Systems."},{"key":"e_1_2_2_87_1","first-page":"136","article-title":"Algorithms for materialized view design in data warehousing environment","volume":"97","author":"Yang Jian","year":"1997","unstructured":"Jian Yang, Kamalakar Karlapalem, and Qing Li. 1997. Algorithms for materialized view design in data warehousing environment. In VLDB, Vol. 97. 136--145.","journal-title":"VLDB"},{"key":"e_1_2_2_88_1","volume-title":"NeuroCard: one cardinality estimator for all tables. arXiv preprint arXiv:2006.08109","author":"Yang Zongheng","year":"2020","unstructured":"Zongheng Yang, Amog Kamsetty, Sifei Luan, Eric Liang, Yan Duan, Xi Chen, and Ion Stoica. 2020. NeuroCard: one cardinality estimator for all tables. arXiv preprint arXiv:2006.08109 (2020)."},{"key":"e_1_2_2_89_1","volume-title":"Deep unsupervised cardinality estimation. arXiv preprint arXiv:1905.04278","author":"Yang Zongheng","year":"2019","unstructured":"Zongheng Yang, Eric Liang, Amog Kamsetty, Chenggang Wu, Yan Duan, Xi Chen, Pieter Abbeel, Joseph M Hellerstein, Sanjay Krishnan, and Ion Stoica. 2019. Deep unsupervised cardinality estimation. arXiv preprint arXiv:1905.04278 (2019)."},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2735381"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915240"},{"key":"e_1_2_2_92_1","volume-title":"Approximate query processing for group-by queries based on conditional generative models. arXiv preprint arXiv:2101.02914","author":"Zhang Meifan","year":"2021","unstructured":"Meifan Zhang and Hongzhi Wang. 2021. Approximate query processing for group-by queries based on conditional generative models. arXiv preprint arXiv:2101.02914 (2021)."},{"key":"e_1_2_2_93_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.148"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:54Z","timestamp":1750182534000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589269"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,13]]},"references-count":93,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6,13]]}},"alternative-id":["10.1145\/3589269"],"URL":"https:\/\/doi.org\/10.1145\/3589269","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,13]]}}}