{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T09:28:29Z","timestamp":1761989309603},"reference-count":57,"publisher":"Association for Computing Machinery (ACM)","issue":"7","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2019,3]]},"abstract":"<jats:p>Data plays an important role in applications, analytic processes, and many aspects of human activity. As data grows in size and complexity, we are met with an imperative need for tools that promote understanding and explanations over data-related operations. Data management research on explanations has focused on the assumption that data resides in a single dataset, under one common schema. But the reality of today's data is that it is frequently unintegrated, coming from different sources with different schemas. When different datasets provide different answers to semantically similar questions, understanding the reasons for the discrepancies is challenging and cannot be handled by the existing single-dataset solutions.<\/jats:p>\n          <jats:p>In this paper, we propose explain3D, a framework for explaining the disagreements across disjoint datasets (3D). Explain3D focuses on identifying the reasons for the differences in the results of two semantically similar queries operating on two datasets with potentially different schemas. Our framework leverages the queries to perform a semantic mapping across the relevant parts of their provenance; discrepancies in this mapping point to causes of the queries' differences. Exploiting the queries gives explain3D an edge over traditional schema matching and record linkage techniques, which are query-agnostic. Our work makes the following contributions: (1) We formalize the problem of deriving optimal explanations for the differences of the results of semantically similar queries over disjoint datasets. Our optimization problem considers two types of explanations, provenance-based and value-based, defined over an evidence mapping, which makes our solution interpretable. (2) We design a 3-stage framework for solving the optimal explanation problem. (3) We develop a smart-partitioning optimizer that improves the efficiency of the framework by orders of magnitude. (4) We experiment with real-world and synthetic data to demonstrate that explain3D can derive precise explanations efficiently, and is superior to alternative methods based on integration techniques and single-dataset explanation frameworks.<\/jats:p>","DOI":"10.14778\/3317315.3317320","type":"journal-article","created":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:27:58Z","timestamp":1556717278000},"page":"779-792","source":"Crossref","is-referenced-by-count":3,"title":["Explain\n            <scp>3D<\/scp>"],"prefix":"10.14778","volume":"12","author":[{"given":"Xiaolan","family":"Wang","sequence":"first","affiliation":[{"name":"University of Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandra","family":"Meliou","sequence":"additional","affiliation":[{"name":"University of Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850579"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066283"},{"key":"e_1_2_1_3_1","volume-title":"John Wiley & Sons","author":"Bazaraa M. S.","year":"2011"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593663"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0098-x"},{"key":"e_1_2_1_6_1","first-page":"452","volume-title":"CAiSE","author":"Berlin J.","year":"2002"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646090.680403"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972764.5"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1456650.1456651"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066175"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/645504.656274"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559901"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559901"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402742"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the International Conference on Intelligence Analysis","author":"Davis J.","year":"2005"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498344"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007612"},{"key":"e_1_2_1_19_1","volume-title":"Proceedings of the Third International Workshop on Paraphrasing (IWP2005)","author":"Dolan W. B.","year":"2005"},{"key":"e_1_2_1_20_1","volume-title":"In Proceedings of the KDD-2004 Workshop on Multi-Relational Data Mining. Citeseer","author":"Domingos P.","year":"2004"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687620"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047486"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3193548"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2876473.2876474"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850583.2850592"},{"key":"e_1_2_1_26_1","first-page":"61","volume-title":"European semantic web symposium","author":"Giunchiglia F.","year":"2004"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921060"},{"key":"e_1_2_1_28_1","volume-title":"International journal of remote sensing, 21(6--7):1331--1364","author":"Hansen M. C.","year":"2000"},{"key":"e_1_2_1_29_1","unstructured":"IBM CPLEX: High-performance software for mathematical programming and optimization 2005.  IBM CPLEX: High-performance software for mathematical programming and optimization 2005."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.781637"},{"key":"e_1_2_1_32_1","first-page":"113","volume-title":"ICPP (3)","author":"Karypis G.","year":"1995"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20(1):359--392 1998.   G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing 20(1):359--392 1998.","DOI":"10.1137\/S1064827595287997"},{"key":"e_1_2_1_34_1","doi-asserted-by":"crossref","unstructured":"B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49(2):291--307 1970.  B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. The Bell system technical journal 49(2):291--307 1970.","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2180912.2180913"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514894.1514901"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2009.10.003"},{"key":"e_1_2_1_38_1","unstructured":"J. Madhavan P. A. Bernstein and E. Rahm. Generic schema matching with cupid. In vldb volume 1 pages 49--58 2001.   J. Madhavan P. A. Bernstein and E. Rahm. Generic schema matching with cupid. In vldb volume 1 pages 49--58 2001."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/1880172.1880176"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3240491"},{"key":"e_1_2_1_41_1","doi-asserted-by":"crossref","unstructured":"J. C. Phillips R. Braun W. Wang J. Gumbart E. Tajkhorshid E. Villa C. Chipot R. D. Skeel L. Kale and K. Schulten. Scalable molecular dynamics with NAMD. Journal of computational chemistry 26(16):1781--1802 2005.  J. C. Phillips R. Braun W. Wang J. Gumbart E. Tajkhorshid E. Villa C. Chipot R. D. Skeel L. Kale and K. Schulten. Scalable molecular dynamics with NAMD. Journal of computational chemistry 26(16):1781--1802 2005.","DOI":"10.1002\/jcc.20289"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856325"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749452"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856329"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2588578"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593664"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2745754.2745765"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2367502.2367554"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807172"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2750549"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824117"},{"key":"e_1_2_1_52_1","unstructured":"X. Wang L. Haas and A. Meliou. Explaining data integration. Data Engineering Bulletin 41(2) 2018.  X. Wang L. Haas and A. Meliou. Explaining data integration. Data Engineering Bulletin 41(2) 2018."},{"key":"e_1_2_1_53_1","unstructured":"X. Wang and A. Meliou. Explain3D: Explaining disagreements in disjoint datasets. CoRR abs\/1903.09246 2019.  X. Wang and A. Meliou. Explain3D: Explaining disagreements in disjoint datasets. CoRR abs\/1903.09246 2019."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1921004"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536337"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536354.2536356"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536374"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3317315.3317320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:08:50Z","timestamp":1672225730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3317315.3317320"}},"subtitle":["explaining disagreements in disjoint datasets"],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":57,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["10.14778\/3317315.3317320"],"URL":"https:\/\/doi.org\/10.14778\/3317315.3317320","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}