{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:17:47Z","timestamp":1773317867516,"version":"3.50.1"},"reference-count":27,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>Data integration systems often provide a uniform query interface, called a<jats:italic>mediated schema<\/jats:italic>, to a multitude of data sources. To answer user queries, such systems employ a set of<jats:italic>semantic matches<\/jats:italic>between the mediated schema and the data-source schemas. Finding such matches is well known to be difficult. Hence much work has focused on developing semi-automatic techniques to efficiently find the matches. In this paper we consider the complementary problem of<jats:italic>improving the mediated schema<\/jats:italic>, to make finding such matches easier. Specifically, a mediated schema<jats:italic>S<\/jats:italic>will typically be matched with many source schemas. Thus,<jats:italic>can the developer of S analyze and revise S in a way that preserves S's semantics, and yet makes it easier to match with in the future?<\/jats:italic><\/jats:p><jats:p>In this paper we provide an affirmative answer to the above question, and outline a promising solution direction, called<jats:bold>mSeer<\/jats:bold>. Given a mediated schema<jats:italic>S<\/jats:italic>and a matching tool<jats:italic>M<\/jats:italic>,<jats:bold>mSeer<\/jats:bold>first computes a matchability score that quantifies how well<jats:italic>S<\/jats:italic>can be matched against using<jats:italic>M<\/jats:italic>. Next,<jats:bold>mSeer<\/jats:bold>uses this score to generate a matchability report that identifies the problems in matching<jats:italic>S.<\/jats:italic>Finally,<jats:bold>mSeer<\/jats:bold>addresses these problems by automatically suggesting changes to<jats:italic>S<\/jats:italic>(e.g., renaming an attribute, reformatting data values, etc.) that it believes will preserve the semantics of<jats:italic>S<\/jats:italic>and yet make it more amenable to matching. We present extensive experiments over several real-world domains that demonstrate the promise of the proposed approach.<\/jats:p>","DOI":"10.14778\/1453856.1453940","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"773-784","source":"Crossref","is-referenced-by-count":12,"title":["Analyzing and revising data integration schemas to improve their matchability"],"prefix":"10.14778","volume":"1","author":[{"given":"Xiaoyong","family":"Chai","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayssam","family":"Sayyadian","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"AnHai","family":"Doan","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnon","family":"Rosenthal","sequence":"additional","affiliation":[{"name":"The MITRE Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Len","family":"Seligman","sequence":"additional","affiliation":[{"name":"The MITRE Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/775152.775180"},{"key":"e_1_2_1_2_1","unstructured":"Y. An A. Borgida R. J. Miller and J. Mylopoulos. A semantic approach to discovering schema mapping expressions. In ICDE-07. Y. An A. Borgida R. J. Miller and J. Mylopoulos. A semantic approach to discovering schema mapping expressions. In ICDE-07 ."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066283"},{"key":"e_1_2_1_4_1","unstructured":"L. Barbosa J. Freire and A. Silva. Organizing hidden-web databases by clustering visible web documents. In ICDE-07. L. Barbosa J. Freire and A. Silva. Organizing hidden-web databases by clustering visible web documents. In ICDE-07."},{"key":"e_1_2_1_5_1","unstructured":"P. A. Bernstein S. Melnik and J. E. Churchill. Incremental schema matching. In VLDB-06. P. A. Bernstein S. Melnik and J. E. Churchill. Incremental schema matching. In VLDB-06."},{"key":"e_1_2_1_6_1","unstructured":"L. Chiticariu and W. C. Tan. Debugging schema mappings with routes. In VLDB-06. L. Chiticariu and W. C. Tan. Debugging schema mappings with routes. In VLDB-06."},{"key":"e_1_2_1_7_1","volume-title":"DS-7","author":"Clifton C.","year":"1997","unstructured":"C. Clifton , E. Housman , and A. Rosenthal . Experience with a combined approach to attribute-matching across heterogeneous databases . In DS-7 , 1997 . C. Clifton, E. Housman, and A. Rosenthal. Experience with a combined approach to attribute-matching across heterogeneous databases. In DS-7, 1997."},{"key":"e_1_2_1_8_1","unstructured":"P. Cudre-Mauroux S. Agarwal A. Budura P. Haghani and K. Aberer. Self-organizing schema mappings in the gridvine peer data management system. In VLDB-07. P. Cudre-Mauroux S. Agarwal A. Budura P. Haghani and K. Aberer. Self-organizing schema mappings in the gridvine peer data management system. In VLDB-07 ."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007612"},{"key":"e_1_2_1_10_1","series-title":"IMS Lecture Series","doi-asserted-by":"crossref","DOI":"10.1214\/lnms\/1215467407","volume-title":"Group representation in probability and statistics","author":"Diaconis P.","year":"1988","unstructured":"P. Diaconis . Group representation in probability and statistics . IMS Lecture Series . Institute of Mathematical Statistics , 11, 1988 . P. Diaconis. Group representation in probability and statistics. IMS Lecture Series. Institute of Mathematical Statistics, 11, 1988."},{"key":"e_1_2_1_11_1","volume-title":"Web, Web-Services","author":"Do H. H.","year":"2002","unstructured":"H. H. Do , S. Melnik , and E. Rahm . Comparison of schema matching evaluations . In Web, Web-Services , and Database Systems , 2002 . H. H. Do, S. Melnik, and E. Rahm. Comparison of schema matching evaluations. In Web, Web-Services, and Database Systems, 2002."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375731"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1041410.1041412"},{"key":"e_1_2_1_14_1","unstructured":"A. Halevy and C. Li. Information integration research: The NSF IDM workshop breakout session. In IDM-03. A. Halevy and C. Li. Information integration research: The NSF IDM workshop breakout session. In IDM-03."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872783"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-023X(99)00044-0"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247532"},{"key":"e_1_2_1_18_1","unstructured":"S. Melnik H. Garcia-Molina and E. Rahm. Similarity flooding: a versatile graph matching algorithm. In ICDE-02. S. Melnik H. Garcia-Molina and E. Rahm. Similarity flooding: a versatile graph matching algorithm. In ICDE-02."},{"key":"e_1_2_1_19_1","unstructured":"R. J. Miller Y. E. Ioannidis and R. Ramakrishnan. The use of information capacity in schema integration and translation. In VLDB-93. R. J. Miller Y. E. Ioannidis and R. Ramakrishnan. The use of information capacity in schema integration and translation. In VLDB-93."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142503"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_2_1_22_1","volume-title":"AFCEA Federal Database Conf","author":"Rosenthal A.","year":"2001","unstructured":"A. Rosenthal and L. Seligman . Scalability issues in data integration . In AFCEA Federal Database Conf , 2001 . A. Rosenthal and L. Seligman. Scalability issues in data integration. In AFCEA Federal Database Conf, 2001."},{"key":"e_1_2_1_23_1","unstructured":"M. Sayyadian Y. Lee A. Doan and A. Rosenthal. Tuning schema matching software using synthetic scenarios. In VLDB-05. M. Sayyadian Y. Lee A. Doan and A. Rosenthal. Tuning schema matching software using synthetic scenarios. In VLDB-05."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247531"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.92"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375729"},{"key":"e_1_2_1_27_1","unstructured":"K. Zhao R. Ikeda and H. Garcia-Molina. Merging hierarchies using object placement. In ICDE-08. K. Zhao R. Ikeda and H. Garcia-Molina. Merging hierarchies using object placement. In ICDE-08."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/1453856.1453940","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T23:54:51Z","timestamp":1716854091000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/1453856.1453940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.14778\/1453856.1453940"],"URL":"https:\/\/doi.org\/10.14778\/1453856.1453940","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2008,8]]}}}