{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T23:39:15Z","timestamp":1781048355059,"version":"3.54.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031478420","type":"print"},{"value":"9783031478437","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_18","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"259-272","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Discovering Graph Differential Dependencies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9211-7815","authenticated-orcid":false,"given":"Yidi","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4014-4976","authenticated-orcid":false,"given":"Selasi","family":"Kwashie","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5848-7451","authenticated-orcid":false,"given":"Michael","family":"Bewong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junwei","family":"Hu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0487-0615","authenticated-orcid":false,"given":"Arash","family":"Mahboubi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xi","family":"Guo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1618-3553","authenticated-orcid":false,"given":"Zaiwen","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"issue":"4","key":"18_CR1","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s00778-015-0389-y","volume":"24","author":"Z Abedjan","year":"2015","unstructured":"Abedjan, Z., Golab, L., Naumann, F.: Profiling relational data: a survey. VLDB J. 24(4), 557\u2013581 (2015). https:\/\/doi.org\/10.1007\/s00778-015-0389-y","journal-title":"VLDB J."},{"key":"18_CR2","unstructured":"Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499. Santiago, Chile (1994)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic \u2014 CL 2000","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972\u2013986. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_65"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1007\/978-3-540-68125-0_84","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B Bringmann","year":"2008","unstructured":"Bringmann, B., Nijssen, S.: What is frequent in a single graph? In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 858\u2013863. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68125-0_84"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10618-019-00667-7","volume":"34","author":"L Caruccio","year":"2020","unstructured":"Caruccio, L., Deufemia, V., Polese, G.: Mining relaxed functional dependencies from data. Data Min. Knowl. Disc. 34(2), 443\u2013477 (2020)","journal-title":"Data Min. Knowl. Disc."},{"issue":"7","key":"18_CR6","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy, M., Abdelhamid, E., Skiadopoulos, S., Kalnis, P.: Grami: frequent subgraph and pattern mining in a single large graph. Proc. VLDB Endowment 7(7), 517\u2013528 (2014)","journal-title":"Proc. VLDB Endowment"},{"issue":"12","key":"18_CR7","doi-asserted-by":"publisher","first-page":"3782","DOI":"10.14778\/3554821.3554899","volume":"15","author":"W Fan","year":"2022","unstructured":"Fan, W.: Big graphs: challenges and opportunities. Proc. VLDB Endowment 15(12), 3782\u20133797 (2022)","journal-title":"Proc. VLDB Endowment"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Fan, W., Geng, L., Jin, R., Lu, P., Tugay, R., Yu, W.: Linking entities across relations and graphs. In: 2022 IEEE 38th International Conference on Data Engineering (ICDE), pp. 634\u2013647. IEEE (2022)","DOI":"10.1109\/ICDE53745.2022.00052"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3397198","volume":"45","author":"W Fan","year":"2020","unstructured":"Fan, W., Hu, C., Liu, X., Lu, P.: Discovering graph functional dependencies. ACM Trans. Database Syst. (TODS) 45(3), 1\u201342 (2020)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3287285","volume":"44","author":"W Fan","year":"2019","unstructured":"Fan, W., Lu, P.: Dependencies for graphs. ACM Trans. Database Syst. (TODS) 44(2), 1\u201340 (2019)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"7","key":"18_CR11","doi-asserted-by":"publisher","first-page":"752","DOI":"10.14778\/3317315.3317318","volume":"12","author":"W Fan","year":"2019","unstructured":"Fan, W., Lu, P., Tian, C., Zhou, J.: Deducing certain fixes to graphs. Proc. VLDB Endowment 12(7), 752\u2013765 (2019)","journal-title":"Proc. VLDB Endowment"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"5609","DOI":"10.1109\/ACCESS.2020.3048186","volume":"9","author":"Z Feng","year":"2020","unstructured":"Feng, Z., et al.: A schema-driven synthetic knowledge graph generation approach with extended graph differential dependencies (gdd x s). IEEE Access 9, 5609\u20135639 (2020)","journal-title":"IEEE Access"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-08608-8_5","volume-title":"Databases Theory and Applications","author":"S Kwashie","year":"2014","unstructured":"Kwashie, S., Liu, J., Li, J., Ye, F.: Mining differential dependencies: a subspace clustering approach. In: Wang, H., Sharaf, M.A. (eds.) ADC 2014. LNCS, vol. 8506, pp. 50\u201361. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08608-8_5"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-19548-3_1","volume-title":"Databases Theory and Applications","author":"S Kwashie","year":"2015","unstructured":"Kwashie, S., Liu, J., Li, J., Ye, F.: Efficient discovery of differential dependencies through association rules mining. In: Sharaf, M.A., Cheema, M.A., Qi, J. (eds.) ADC 2015. LNCS, vol. 9093, pp. 3\u201315. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19548-3_1"},{"issue":"6","key":"18_CR15","doi-asserted-by":"publisher","first-page":"653","DOI":"10.14778\/3311880.3311883","volume":"12","author":"S Kwashie","year":"2019","unstructured":"Kwashie, S., Liu, L., Liu, J., Stumptner, M., Li, J., Yang, L.: Certus: an effective entity resolution approach with graph differential dependencies (GDDs). Proc. VLDB Endowment 12(6), 653\u2013666 (2019)","journal-title":"Proc. VLDB Endowment"},{"issue":"4","key":"18_CR16","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s41019-018-0082-4","volume":"3","author":"P Lin","year":"2018","unstructured":"Lin, P., Song, Q., Wu, Y.: Fact checking in knowledge graphs with ontological subgraph patterns. Data Sci. Eng. 3(4), 341\u2013358 (2018)","journal-title":"Data Sci. Eng."},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Liu, D., et al.: An efficient approach for discovering graph entity dependencies (GEDs). arXiv preprint arXiv:2301.06264 (2023)","DOI":"10.2139\/ssrn.4578555"},{"key":"18_CR18","unstructured":"Liu, J., Kwashie, S., Li, J., Liu, L., Bewong, M.: Linking graph entities with multiplicity and provenance. In: 2nd International Workshop on EntitY REtrieval: EYRE 2019, pp. 1\u20137. Association for Computing Machinery (ACM) (2019)"},{"issue":"2","key":"18_CR19","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TKDE.2010.197","volume":"24","author":"J Liu","year":"2010","unstructured":"Liu, J., Li, J., Liu, C., Chen, Y.: Discover dependencies from data-a review. IEEE Trans. Knowl. Data Eng. 24(2), 251\u2013264 (2010)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Mhedhbi, A., Salihoglu, S.: Optimizing subgraph queries by combining binary and worst-case optimal joins. Proc. VLDB Endowment, vol. 12. no. 11 (2019)","DOI":"10.14778\/3342263.3342643"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Song, Q., Lin, P., Ma, H., Wu, Y.: Explaining missing data in graphs: a constraint-based approach. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1476\u20131487. IEEE (2021)","DOI":"10.1109\/ICDE51399.2021.00131"},{"issue":"3","key":"18_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2000824.2000826","volume":"36","author":"S Song","year":"2011","unstructured":"Song, S., Chen, L.: Differential dependencies: reasoning and discovery. ACM Trans. Database Syst. (TODS) 36(3), 1\u201341 (2011)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"10","key":"18_CR23","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(10), 4717\u20134736 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Zhou, G., et al.: FASTAGEDS: fast approximate graph entity dependency discovery. arXiv preprint arXiv:2304.02323 (2023)","DOI":"10.1007\/978-981-99-7254-8_35"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:33:54Z","timestamp":1699306434000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"26","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":"0","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":"63% - 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":"2.5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}