{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:52:29Z","timestamp":1773481949565,"version":"3.50.1"},"reference-count":40,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2020,10,15]],"date-time":"2020-10-15T00:00:00Z","timestamp":1602720000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Data and Information Quality"],"published-print":{"date-parts":[[2020,12,31]]},"abstract":"<jats:p>\n            Functional dependencies (\n            <jats:sc>fd<\/jats:sc>\n            s) are one of the metadata used to assess data quality and to perform data cleaning operations. However, to pursue robustness with respect to data errors, it has been necessary to devise imprecise versions of functional dependencies, yielding relaxed functional dependencies (\n            <jats:sc>rfd<\/jats:sc>\n            s). Among them, there exists the class of\n            <jats:sc>rfd<\/jats:sc>\n            s relaxing on the extent, i.e., those admitting the possibility that an\n            <jats:sc>fd<\/jats:sc>\n            holds on a subset of data. In the literature, several algorithms to automatically discover\n            <jats:sc>rfd<\/jats:sc>\n            s from big data collections have been defined. They achieve good performances with respect to the inherent problem complexity. However, most of them are capable of discovering\n            <jats:sc>rfd<\/jats:sc>\n            s only by batch processing the entire dataset. This is not suitable in the era of big data, where the size of a database instance can grow with high-velocity, and the insertion of new data can invalidate previously holding\n            <jats:sc>rfd<\/jats:sc>\n            s. Thus, it is necessary to devise incremental discovery algorithms capable of updating the set of holding\n            <jats:sc>rfd<\/jats:sc>\n            s upon data insertions, without processing the entire dataset. To this end, in this article we propose an incremental discovery algorithm for\n            <jats:sc>rfd<\/jats:sc>\n            s relaxing on the extent. It manages the validation of candidate\n            <jats:sc>rfd<\/jats:sc>\n            s and the generation of possibly new\n            <jats:sc>rfd<\/jats:sc>\n            candidates upon the insertion of the new tuples, while limiting the size of the overall search space. Experimental results show that the proposed algorithm achieves extremely good performances on real-world datasets.\n          <\/jats:p>","DOI":"10.1145\/3397462","type":"journal-article","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T12:34:39Z","timestamp":1594125279000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Incremental Discovery of Imprecise Functional Dependencies"],"prefix":"10.1145","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2418-1606","authenticated-orcid":false,"given":"Loredana","family":"Caruccio","sequence":"first","affiliation":[{"name":"University of Salerno, Fisciano (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Cirillo","sequence":"additional","affiliation":[{"name":"University of Salerno, Fisciano (SA), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-015-0389-y"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661884"},{"key":"e_1_2_1_3_1","unstructured":"K. Bache and M. Lichman. 2017. UCI Machine Learning Repository. University of California School of Information and Computer Science Irvine CA.  K. Bache and M. Lichman. 2017. UCI Machine Learning Repository. University of California School of Information and Computer Science Irvine CA."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (KDD\u201995)","author":"Bell Siegfried","year":"1995"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2938503.2938519"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2472010"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3102254.3102259"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2017.00-88"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Twelfth International Conference on Data Engineering. IEEE, 106--114","author":"Cheung David W."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-0578(07)60184-0"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1497136.1497142"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/1216155.1216159"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.10.006"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80017-6"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1526987.1526989"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1998.655802"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/42.2.100"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007641"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1155\/S117391260300004X"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00028-U"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/3192965.3192968"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.197"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46439-5_24"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645914.671482"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1086"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2590989.2590995"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44503-X_13"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/2794367.2794377"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915203"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-008-0092-3"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 35th International Conference on Data Engineering (ICDE\u201919)","author":"Saxena Hemant"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342638"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the 22nd International Conference on Extending Database Technology (EDBT\u201919)","author":"Schirmer Philipp","year":"2019"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002360100078"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/NAFIPS.2001.943739"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00137"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44801-2_11"},{"key":"e_1_2_1_39_1","volume-title":"Proceedings of the 2nd IEEE International Conference on Data Mining (ICDM\u201902)","author":"Yao Hong"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18576-3_10"}],"container-title":["Journal of Data and Information Quality"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:33Z","timestamp":1750200093000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,15]]},"references-count":40,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12,31]]}},"alternative-id":["10.1145\/3397462"],"URL":"https:\/\/doi.org\/10.1145\/3397462","relation":{},"ISSN":["1936-1955","1936-1963"],"issn-type":[{"value":"1936-1955","type":"print"},{"value":"1936-1963","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,15]]},"assertion":[{"value":"2019-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-10-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}