{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T01:45:52Z","timestamp":1787017552100,"version":"build-2736575974"},"reference-count":94,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100006374","name":"ShanghaiTech University","doi-asserted-by":"publisher","award":["e ShanghaiTech Startup Fund"],"award-info":[{"award-number":["e ShanghaiTech Startup Fund"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>This paper studies incremental rule discovery. Given a dataset D, rule discovery is to mine the set of the rules on D such that their supports and confidences are above thresholds \ud835\udf0e and \ud835\udec5 , respectively. We formulate incremental problems in response to updates \u0394\ud835\udf0e and\/or \u0394\ud835\udec5, to compute rules added and\/or removed with respect to \ud835\udf0e + \u0394\ud835\udf0e and \ud835\udec5 + \u0394\ud835\udec5. The need for studying the problems is evident since practitioners often want to adjust their support and confidence thresholds during discovery. The objective is to minimize unnecessary recomputation during the adjustments, not to restart the costly discovery process from scratch. As a testbed, we consider entity enhancing rules, which subsume popular data quality rules as special cases. We develop three incremental algorithms, in response to \u0394\ud835\udf0e , \u0394\ud835\udf0e and both. We show that relative to a batch discovery algorithm, these algorithms are bounded, i.e., they incur the minimum cost among all incrementalizations of the batch one, and parallelly scalable, i.e., they guarantee to reduce runtime when given more processors. Using real-life data, we empirically verify that the incremental algorithms outperform the batch counterpart by up to 658\u00d7 when \u0394\ud835\udf0e and \u0394\ud835\udf0e are either positive or negative.<\/jats:p>","DOI":"10.1145\/3725312","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-28","source":"Crossref","is-referenced-by-count":2,"title":["Incremental Rule Discovery in Response to Parameter Updates"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8574-2120","authenticated-orcid":false,"given":"Haoxian","family":"Chen","sequence":"first","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5149-2656","authenticated-orcid":false,"given":"Wenfei","family":"Fan","sequence":"additional","affiliation":[{"name":"Shenzhen Institute of Computing Sciences, Shenzhen, China, University of Edinburgh, Edinburgh, United Kingdom, and Beihang University, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-4572-104X","authenticated-orcid":false,"given":"Jiaye","family":"Zheng","sequence":"additional","affiliation":[{"name":"ShanghaiTech University, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_2_1_1","first-page":"949","article-title":"DFD: Efficient functional dependency discovery","author":"Abedjan Ziawasch","year":"2014","unstructured":"Ziawasch Abedjan, Patrick Schulze, and Felix Naumann. 2014. DFD: Efficient functional dependency discovery. In CIKM. 949-958.","journal-title":"CIKM."},{"key":"e_1_2_2_2_1","volume-title":"Foundations of Databases","author":"Abiteboul Serge","unstructured":"995)]% AbHuVi1995 , Serge Abiteboul, Richard Hull, and Victor Vianu. 1995. Foundations of Databases. Addison-Wesley."},{"key":"e_1_2_2_3_1","unstructured":"Rakesh Agrawal and Ramakrishnan Srikant. 1994. Fast Algorithms for Mining Association Rules in Large Databases. In VLDB."},{"key":"e_1_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2484318"},{"key":"e_1_2_2_5_1","article-title":"Learning Certifiably Optimal Rule Lists for Categorical Data","volume":"18","author":"Angelino Elaine","year":"2017","unstructured":"Elaine Angelino, Nicholas Larus-Stone, Daniel Alabi, Margo I. Seltzer, and Cynthia Rudin. 2017. Learning Certifiably Optimal Rule Lists for Categorical Data. J. Mach. Learn. Res., Vol. 18 (2017), 234:1-234:78.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.3390\/app9245398"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/303976.303983"},{"key":"e_1_2_2_8_1","volume-title":"Rock: Cleaning Data by Embedding ML in Logic Rules. In SIGMOD (industrial track). ACM.","author":"Bao Xianchun","year":"2024","unstructured":"Xianchun Bao, Zian Bao, Qingsong Duan, Wenfei Fan, Hui Lei, Daji Li, Wei Lin, Peng Liu, Zhicong Lv, Mingliang Ouyang, Jiale Peng, Jing Zhang, Runxiao Zhao, Shuai Tang, Shuping Zhou, Yaoshu Wang, Qiyuan Wei, and Min Xie. 2024. Rock: Cleaning Data by Embedding ML in Logic Rules. In SIGMOD (industrial track). ACM."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/3157794.3157800"},{"key":"e_1_2_2_10_1","unstructured":"Leo Breiman J. H. Friedman R. A. Olshen and C. J. Stone. 1984. Classification and Regression Trees. Wadsworth."},{"key":"e_1_2_2_11_1","first-page":"278","article-title":"Smurf","volume":"12","author":"Adel Ardalan Paul Suganthan G. C.","year":"2018","unstructured":"Paul Suganthan G. C., Adel Ardalan, AnHai Doan, and Aditya Akella. 2018. Smurf: Self-Service String Matching Using Random Forests. PVLDB, Vol. 12, 3 (2018), 278-291.","journal-title":"Self-Service String Matching Using Random Forests. PVLDB"},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3397462"},{"key":"e_1_2_2_13_1","volume-title":"Symposium on Advanced Database Systems (SEBD), (CEUR Workshop Proceedings","author":"Caruccio Loredana","year":"2019","unstructured":"Loredana Caruccio, Stefano Cirillo, Vincenzo Deufemia, and Giuseppe Polese. 2019. Incremental Discovery of Functional Dependencies with a Bit-vector Algorithm. In Symposium on Advanced Database Systems (SEBD), (CEUR Workshop Proceedings, Vol. 2400). CEUR-WS.org."},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3487664.3487719"},{"key":"e_1_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514927"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.07.008"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775114"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.04.018"},{"key":"e_1_2_2_19_1","first-page":"604","volume-title":"International Conference on Artificial Intelligence and Statistics (AISTATS)","volume":"84","author":"Chen Chaofan","year":"2018","unstructured":"Chaofan Chen and Cynthia Rudin. 2018. An Optimization Approach to Learning Falling Rule Lists. In International Conference on Artificial Intelligence and Statistics (AISTATS),, Vol. 84. PMLR,, 604-612."},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536258.2536262"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11430919_59"},{"key":"e_1_2_2_22_1","volume-title":"Fast Effective Rule Induction. In International Conference on Machine Learning. Morgan Kaufmann, 115-123","author":"Cohen William W.","year":"1995","unstructured":"William W. Cohen. 1995. Fast Effective Rule Induction. In International Conference on Machine Learning. Morgan Kaufmann, 115-123."},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602136"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1366102.1366103"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.154"},{"key":"e_1_2_2_26_1","volume-title":"Proc. ACM Manag. Data","author":"Fan Wenfei","year":"2024","unstructured":"Wenfei Fan, Ziyan Han, Weilong Ren Yaoshu Wang, Min Xie, and Mengyi Yan. 2024a. Splitting Tuples of Mismatched Entities. Proc. ACM Manag. Data, (2024)."},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3526165"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588924"},{"key":"e_1_2_2_29_1","first-page":"1173","article-title":"Capturing More Associations by Referencing Knowledge Graphs","volume":"17","author":"Fan Wenfei","year":"2024","unstructured":"Wenfei Fan, Muyang Liu, Shuhao Liu, and Chao Tian. 2024b. Capturing More Associations by Referencing Knowledge Graphs. PVLDB, Vol. 17, 6 (2024), 1173-1186.","journal-title":"PVLDB"},{"key":"e_1_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-2917-1"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3500930"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3457390.3457400"},{"key":"e_1_2_2_33_1","first-page":"459","article-title":"Incrementalizing Graph Algorithms","author":"Fan Wenfei","year":"2021","unstructured":"Wenfei Fan, Chao Tian, Ruiqi Xu, Qiang Yin, Wenyuan Yu, and Jingren Zhou. 2021b. Incrementalizing Graph Algorithms. In SIGMOD. 459-471.","journal-title":"SIGMOD."},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824048"},{"key":"e_1_2_2_35_1","volume-title":"Database dependency discovery: A machine learning approach. AI communications","author":"Flach Peter A","year":"1999","unstructured":"Peter A Flach and Iztok Savnik. 1999. Database dependency discovery: A machine learning approach. AI communications, Vol. 12, 3 (1999), 139-160."},{"key":"e_1_2_2_36_1","volume-title":"Incremental Reduced Error Pruning. In International Conference on Machine Learning. Morgan Kaufmann, 70-77","author":"F\u00fcrnkranz Johannes","year":"1994","unstructured":"Johannes F\u00fcrnkranz and Gerhard Widmer. 1994. Incremental Reduced Error Pruning. In International Conference on Machine Learning. Morgan Kaufmann, 70-77."},{"key":"e_1_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314107"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364332"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.03.002"},{"key":"e_1_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453900"},{"key":"e_1_2_2_41_1","unstructured":"Jiawei Han Jian Pei and Yiwen Yin. 2000. Mining Frequent Patterns without Candidate Generation. In SIGMOD."},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11795131_72"},{"key":"e_1_2_2_43_1","volume-title":"TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The computer journal","author":"Huhtala Yk\u00e4","year":"1999","unstructured":"Yk\u00e4 Huhtala, Juha K\u00e4rkk\u00e4inen, Pasi Porkka, and Hannu Toivonen. 1999. TANE: An Efficient Algorithm for Discovering Functional and Approximate Dependencies. The computer journal, Vol. 42, 2 (1999), 100-111."},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/CIT.2006.101"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/11539506_150"},{"key":"e_1_2_2_46_1","volume-title":"Reducibility among combinatorial problems","author":"Karp Richard M","unstructured":"Richard M Karp. 2010. Reducibility among combinatorial problems. Springer."},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920904"},{"key":"e_1_2_2_48_1","first-page":"712","article-title":"MDedup: Duplicate detection with matching dependencies","volume":"13","author":"Papenbrock Thorsten","year":"2020","unstructured":"loannis Koumarelas, Thorsten Papenbrock, and Felix Naumann. 2020. MDedup: Duplicate detection with matching dependencies. PVLDB, Vol. 13, 5 (2020), 712-725.","journal-title":"PVLDB"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90192-K"},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30549-1_35"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29295-0_9"},{"key":"e_1_2_2_53_1","first-page":"6150","volume-title":"Generalized and Scalable Optimal Sparse Decision Trees. In International Conference on Machine Learning (ICML)","volume":"119","author":"Lin Jimmy","unstructured":"Jimmy Lin, Chudi Zhong, Diane Hu, Cynthia Rudin, and Margo I. Seltzer. 2020. Generalized and Scalable Optimal Sparse Decision Trees. In International Conference on Machine Learning (ICML),, Vol. 119. PMLR, , 6150-6160."},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401966"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24"},{"key":"e_1_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1177\/0165551508100382"},{"key":"e_1_2_2_57_1","volume-title":"KDD: AAAI workshop on Knowledge Discovery in Databases. Citeseer, 181-192","author":"Mannila Heikki","year":"1994","unstructured":"Heikki Mannila, Hannu Toivonen, and A Inkeri Verkamo. 1994. Efficient algorithms for discovering association rules. In KDD: AAAI workshop on Knowledge Discovery in Databases. Citeseer, 181-192."},{"key":"e_1_2_2_58_1","volume-title":"Muggleton and Luc De Raedt","author":"Stephen","year":"1994","unstructured":"Stephen H. Muggleton and Luc De Raedt. 1994. Inductive Logic Programming: Theory and Methods. J. Log. Program., Vol. 19\/20 (1994), 629-679."},{"key":"e_1_2_2_59_1","volume-title":"Fun: An efficient algorithm for mining functional and embedded dependencies","author":"Novelli Noel","year":"2001","unstructured":"Noel Novelli and Rosine Cicchetti. 2001. Fun: An efficient algorithm for mining functional and embedded dependencies. In ICDT. Springer, 189-203."},{"key":"e_1_2_2_60_1","doi-asserted-by":"crossref","unstructured":"Thorsten Papenbrock and Felix Naumann. 2016. A Hybrid Approach to Functional Dependency Discovery. In SIGMOD.","DOI":"10.1145\/2882903.2915203"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2002.1183923"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.14778\/3368289.3368293"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-023-00788-y"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022643204877"},{"key":"e_1_2_2_65_1","unstructured":"J. Ross Quinlan. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann."},{"key":"e_1_2_2_66_1","unstructured":"J. Ross Quinlan. 2004. Data Mining Tools See5 and C5.0."},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137631"},{"key":"e_1_2_2_68_1","first-page":"1005","article-title":"Mining frequent itemsets through progressive sampling with rademacher averages","author":"Riondato Matteo","year":"2015","unstructured":"Matteo Riondato and Eli Upfal. 2015. Mining frequent itemsets through progressive sampling with rademacher averages. In SIGKDD. ACM, 1005-1014.","journal-title":"SIGKDD. ACM"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-019-0048-x"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.5555\/2567709.2567773"},{"key":"e_1_2_2_71_1","doi-asserted-by":"publisher","DOI":"10.1109\/DEXA.1998.707409"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3392778"},{"key":"e_1_2_2_73_1","unstructured":"Philipp Schirmer Thorsten Papenbrock Sebastian Kruse Felix Naumann Dennis Hempfing Torben Mayer and Daniel Neusch\u00e4fer-Rube. 2019. DynFD: Functional Dependency Discovery in Dynamic Datasets. In EDBT."},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.14778\/3149193.3149199"},{"key":"e_1_2_2_75_1","doi-asserted-by":"crossref","unstructured":"Shaoxu Song and Lei Chen. 2009. Discovering matching dependencies. In CIKM.","DOI":"10.1145\/1645953.1646135"},{"key":"e_1_2_2_76_1","unstructured":"Apache Spark. 2024. Frequent Pattern Mining. https:\/\/spark.apache.org\/docs\/latest\/ml-frequent-pattern-mining.html."},{"key":"e_1_2_2_77_1","volume-title":"Mining Sequential Patterns: Generalizations and Performance Improvements","author":"Srikant Ramakrishnan","unstructured":"Ramakrishnan Srikant and Rakesh Agrawal. 1996. Mining Sequential Patterns: Generalizations and Performance Improvements. In EDBT. Springer, 3-17."},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401965"},{"key":"e_1_2_2_79_1","first-page":"990","article-title":"ArnetMiner","author":"Tang Jie","year":"2008","unstructured":"Jie Tang, Jing Zhang, Limin Yao, Juanzi Li, Li Zhang, and Zhong Su. 2008. ArnetMiner: Extraction and Mining of Academic Social Networks. In KDD. 990-998.","journal-title":"Extraction and Mining of Academic Social Networks. In KDD."},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3071777"},{"key":"e_1_2_2_81_1","first-page":"134","article-title":"Sampling large databases for association rules","author":"Toivonen Hannu","year":"1996","unstructured":"Hannu Toivonen. 1996. Sampling large databases for association rules. In VLDB. 134-145.","journal-title":"VLDB."},{"key":"e_1_2_2_82_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48912-6_10"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44418-1_1"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_2_2_85_1","volume-title":"Honavar","author":"Vasile Flavian","year":"2006","unstructured":"Flavian Vasile, Adrian Silvescu, Dae-Ki Kang, and Vasant G. Honavar. 2006. TRIPPER: Rule Learning Using Taxonomies. In PAKDD."},{"key":"e_1_2_2_86_1","article-title":"A Bayesian Framework for Learning Rule Sets for Interpretable Classification","volume":"18","author":"Wang Tong","year":"2017","unstructured":"Tong Wang, Cynthia Rudin, Finale Doshi-Velez, Yimin Liu, Erica Klampfl, and Perry MacNeille. 2017. A Bayesian Framework for Learning Rule Sets for Interpretable Classification. J. Mach. Learn. Res., Vol. 18 (2017), 70:1-70:37.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_2_2_87_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-005-0255-4"},{"key":"e_1_2_2_88_1","volume-title":"Robertson","author":"Wyss Catharine M.","year":"2001","unstructured":"Catharine M. Wyss, Chris Giannella, and Edward L. Robertson. 2001. FastFDs: A Heuristic-Driven, Depth-First Algorithm for Mining Functional Dependencies from Relation Instances - Extended Abstract. In DaWak."},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733022"},{"key":"e_1_2_2_90_1","volume-title":"International Conference on Data Mining (ICDM). IEEE Computer Society, 729-732","author":"Yao Hong","unstructured":"Hong Yao, Howard J. Hamilton, and Cory J. Butz. 2002. FD_Mine: Discovering Functional Dependencies in a Database Using Equivalences. In International Conference on Data Mining (ICDM). IEEE Computer Society, 729-732."},{"key":"e_1_2_2_91_1","volume-title":"New Algorithms for Fast Discovery of Association Rules","author":"Zaki Mohammed Javeed","unstructured":"Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mitsunori Ogihara, and Wei Li. 1997. New Algorithms for Fast Discovery of Association Rules. In KDD. AAAI Press, 283-286."},{"key":"e_1_2_2_92_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020995206763"},{"key":"e_1_2_2_93_1","first-page":"861","article-title":"A Statistical Perspective on Discovering Functional Dependencies in Noisy Data","author":"Zhang Yunjia","year":"2020","unstructured":"Yunjia Zhang, Zhihan Guo, and Theodoros Rekatsinas. 2020. A Statistical Perspective on Discovering Functional Dependencies in Noisy Data. In SIGMOD. 861-876.","journal-title":"SIGMOD."},{"key":"e_1_2_2_94_1","first-page":"112","volume-title":"AMT","volume":"138","author":"Zhao Yanchang","year":"2006","unstructured":"Yanchang Zhao, Chengqi Zhang, and Shichao Zhang. 2006. Efficient Frequent Itemsets Mining by Sampling. AMT, Vol. 138 (2006), 112-7."}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725312","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:54:01Z","timestamp":1774983241000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725312"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":94,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725312"],"URL":"https:\/\/doi.org\/10.1145\/3725312","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}