{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T05:41:38Z","timestamp":1776404498976,"version":"3.51.2"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031409592","type":"print"},{"value":"9783031409608","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40960-8_1","type":"book-chapter","created":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T21:01:25Z","timestamp":1692133285000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Functional Dependencies with\u00a0Predicates: What Makes the\u00a0g3-error Easy to\u00a0Compute?"],"prefix":"10.1007","author":[{"given":"Simon","family":"Vilmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Faure\u2013Giovagnoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Marc","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vasile-Marian","family":"Scuturici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,16]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/3-540-45357-1_59","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R Bass\u00e9e","year":"2001","unstructured":"Bass\u00e9e, R., Wijsen, J.: Neighborhood dependencies for prediction. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol. 2035, pp. 562\u2013567. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45357-1_59"},{"key":"1_CR2","volume-title":"Graphs and Hypergraphs","author":"C Berge","year":"1973","unstructured":"Berge, C.: Graphs and Hypergraphs. North-Holland Pub. Co., Amsterdam (1973)"},{"issue":"5","key":"1_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-01883-1","volume":"3","author":"L Bertossi","year":"2011","unstructured":"Bertossi, L.: Database repairing and consistent query answering. Synth. Lect. Data Manag. 3(5), 1\u2013121 (2011)","journal-title":"Synth. Lect. Data Manag."},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/11601524_17","volume-title":"Database Programming Languages","author":"L Bertossi","year":"2005","unstructured":"Bertossi, L., Bravo, L., Franconi, E., Lopatenko, A.: Complexity and approximation of fixing numerical attributes in databases under integrity constraints. In: Bierman, G., Koch, C. (eds.) DBPL 2005. LNCS, vol. 3774, pp. 262\u2013278. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11601524_17"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bohannon, P., Fan, W., Geerts, F., Jia, X., Kementsietsidis, A.: Conditional functional dependencies for data cleaning. In: 2007 IEEE 23rd International Conference on Data Engineering, pp. 746\u2013755. IEEE (2007)","DOI":"10.1109\/ICDE.2007.367920"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1109\/TKDE.2015.2472010","volume":"28","author":"L Caruccio","year":"2015","unstructured":"Caruccio, L., Deufemia, V., Polese, G.: Relaxed functional dependencies-a survey of approaches. IEEE Trans. Knowl. Data Eng. 28(1), 147\u2013165 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Caruccio, L., Deufemia, V., Polese, G.: On the discovery of relaxed functional dependencies. In: Proceedings of the 20th International Database Engineering & Applications Symposium, pp. 53\u201361 (2016)","DOI":"10.1145\/2938503.2938519"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Cormode, G., Golab, L., Flip, K., McGregor, A., Srivastava, D., Zhang, X.: Estimating the confidence of conditional functional dependencies. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data, SIGMOD 2009, pp. 469\u2013482. Association for Computing Machinery, New York (2009). https:\/\/doi.org\/10.1145\/1559845.1559895","DOI":"10.1145\/1559845.1559895"},{"key":"1_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"BA Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Dong, J., Hull, R.: Applying approximate order dependency to reduce indexing space. In: Proceedings of the 1982 ACM SIGMOD International Conference on Management of Data, pp. 119\u2013127 (1982)","DOI":"10.1145\/582353.582375"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Fan, W.: Dependencies revisited for improving data quality. In: Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 159\u2013170 (2008)","DOI":"10.1145\/1376916.1376940"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Faure-Giovagnoli, P., Petit, J.M., Scuturici, V.M.: Assessing the existence of a function in a dataset with the g3 indicator. In: IEEE International Conference on Data Engineering (2022)","DOI":"10.1109\/ICDE53745.2022.00050"},{"key":"1_CR13","volume-title":"Computers and Intractability","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, vol. 174. Freeman, San Francisco (1979)"},{"key":"1_CR14","first-page":"17","volume":"1","author":"V Giakoumakis","year":"1997","unstructured":"Giakoumakis, V., Roussel, F., Thuillier, H.: On p_4-tidy graphs. Disc. Math. Theor. Comput. Sci. 1, 17\u201341 (1997)","journal-title":"Disc. Math. Theor. Comput. Sci."},{"issue":"1\u20132","key":"1_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(83)90084-1","volume":"26","author":"S Ginsburg","year":"1983","unstructured":"Ginsburg, S., Hull, R.: Order dependency in the relational model. Theor. Comput. Sci. 26(1\u20132), 149\u2013195 (1983)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"574","DOI":"10.14778\/1687627.1687693","volume":"2","author":"L Golab","year":"2009","unstructured":"Golab, L., Karloff, H., Korn, F., Saha, A., Srivastava, D.: Sequential dependencies. Proc. VLDB Endow. 2(1), 574\u2013585 (2009)","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"376","DOI":"10.14778\/1453856.1453900","volume":"1","author":"L Golab","year":"2008","unstructured":"Golab, L., Karloff, H., Korn, F., Srivastava, D., Yu, B.: On generating near-optimal tableaux for conditional functional dependencies. Proc. VLDB Endow. 1(1), 376\u2013390 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"1_CR18","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"1_CR19","unstructured":"Gribkoff, E., Van den Broeck, G., Suciu, D.: The most probable database problem. In: Proceedings of the First International Workshop on Big Uncertain Data (BUDA), pp. 1\u20137 (2014)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Huhtala, Y., Karkkainen, J., Porkka, P., Toivonen, H.: Efficient discovery of functional and approximate dependencies using partitions. In: Proceedings 14th International Conference on Data Engineering, pp. 392\u2013401. IEEE (1998)","DOI":"10.1109\/ICDE.1998.655802"},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1093\/comjnl\/42.2.100","volume":"42","author":"Y Huhtala","year":"1999","unstructured":"Huhtala, Y., K\u00e4rkk\u00e4inen, J., Porkka, P., Toivonen, H.: Tane: an efficient algorithm for discovering functional and approximate dependencies. Comput. J. 42(2), 100\u2013111 (1999)","journal-title":"Comput. J."},{"issue":"1","key":"1_CR22","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0304-3975(95)00028-U","volume":"149","author":"J Kivinen","year":"1995","unstructured":"Kivinen, J., Mannila, H.: Approximate inference of functional dependencies from relations. Theor. Comput. Sci. 149(1), 129\u2013149 (1995)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Koudas, N., Saha, A., Srivastava, D., Venkatasubramanian, S.: Metric functional dependencies. In: 2009 IEEE 25th International Conference on Data Engineering, pp. 1275\u20131278. IEEE (2009)","DOI":"10.1109\/ICDE.2009.219"},{"key":"1_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-85729-349-7","volume-title":"A Guided Tour of Relational Databases and Beyond","author":"M Levene","year":"2012","unstructured":"Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-0-85729-349-7"},{"issue":"1","key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3360904","volume":"45","author":"E Livshits","year":"2020","unstructured":"Livshits, E., Kimelfeld, B., Roy, S.: Computing optimal repairs for functional dependencies. ACM Trans. Datab. Syst. (TODS) 45(1), 1\u201346 (2020)","journal-title":"ACM Trans. Datab. Syst. (TODS)"},{"key":"1_CR26","unstructured":"Mannila, H., R\u00e4ih\u00e4, K.J.: The Design of Relational Databases. Addison-Wesley Longman Publishing Co., Inc., Boston (1992)"},{"issue":"3","key":"1_CR27","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/502030.502033","volume":"26","author":"W Ng","year":"2001","unstructured":"Ng, W.: An extension of the relational data model to incorporate ordered domains. ACM Trans. Datab. Syst. (TODS) 26(3), 344\u2013383 (2001)","journal-title":"ACM Trans. Datab. Syst. (TODS)"},{"issue":"7","key":"1_CR28","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/S0306-4379(01)00032-1","volume":"26","author":"N Novelli","year":"2001","unstructured":"Novelli, N., Cicchetti, R.: Functional and embedded dependency inference: a data mining point of view. Inf. Syst. 26(7), 477\u2013506 (2001)","journal-title":"Inf. Syst."},{"issue":"2","key":"1_CR29","first-page":"307","volume":"15","author":"S Poljak","year":"1974","unstructured":"Poljak, S.: A note on stable sets and colorings of graphs. Commentationes Mathematicae Universitatis Carolinae 15(2), 307\u2013309 (1974)","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"1_CR30","unstructured":"Song, S.: Data dependencies in the presence of difference. Ph.D. thesis, Hong Kong University of Science and Technology (2010)"},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00778-012-0285-7","volume":"22","author":"S Song","year":"2013","unstructured":"Song, S., Chen, L., Philip, S.Y.: Comparable dependencies over heterogeneous data. VLDB J. 22(2), 253\u2013274 (2013)","journal-title":"VLDB J."},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"4717","DOI":"10.1109\/TKDE.2020.3046443","volume":"34","author":"S Song","year":"2020","unstructured":"Song, S., Gao, F., Huang, R., Wang, C.: Data dependencies extended for variety and veracity: a family tree. IEEE Trans. Knowl. Data Eng. 34, 4717\u20134736 (2020). https:\/\/doi.org\/10.1109\/TKDE.2020.3046443","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Vilmin, S., Faure-Giovagnoli, P., Petit, J.M., Scuturici, V.M.: Functional dependencies with predicates: what makes the $$g_3$$-error easy to compute? arXiv preprint arXiv:2306.09006 (2023)","DOI":"10.1007\/978-3-031-40960-8_1"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40960-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,26]],"date-time":"2024-10-26T06:09:30Z","timestamp":1729922970000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40960-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031409592","9783031409608"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40960-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"16 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Conceptual Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Berlin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-conceptstruct2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccs-conference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 poster papers (not part of the 28)","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}