{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:30Z","timestamp":1759205310435,"version":"3.41.0"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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":["SIGMOD Rec."],"published-print":{"date-parts":[[2004,12]]},"abstract":"<jats:p>\n            Schema matching is a critical problem for integrating heterogeneous information sources. Traditionally, the problem of matching multiple schemas has essentially relied on finding pairwise-attribute correspondences in isolation. In contrast, we propose a new matching paradigm,\n            <jats:italic>holistic schema matching<\/jats:italic>\n            , to match many schemas at the same time and find all matchings at once. By handling a set of schemas together, we can explore their\n            <jats:italic>context<\/jats:italic>\n            information that reflects the semantic correspondences among attributes. Such information is not available when schemas are matched only in pairs. As the realizations of holistic schema matching, we develop two alternative approaches:\n            <jats:italic>global evaluation<\/jats:italic>\n            and\n            <jats:italic>local evaluation<\/jats:italic>\n            . Global evaluation exhaustively assesses all possible \"models,\" where a\n            <jats:italic>model<\/jats:italic>\n            expresses all attribute matchings. In particular, we propose the MGS framework for such global evaluation, building upon the hypothesis of the existence of a hidden schema model that probabilistically generates the schemas we observed. On the other hand, local evaluation independently assesses every single matching to incrementally construct such a model. In particular, we develop the DCM framework for local evaluation, building upon the observation that co-occurrence patterns across schemas often reveal the complex relationships of attributes. We apply our approaches to match query interfaces on the deep Web. The result shows the effectiveness of both the MGS and DCM approaches, which together demonstrate the promise of holistic schema matching.\n          <\/jats:p>","DOI":"10.1145\/1041410.1041414","type":"journal-article","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T22:23:27Z","timestamp":1131575007000},"page":"20-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["A holistic paradigm for large scale schema matching"],"prefix":"10.1145","volume":"33","author":[{"given":"Bin","family":"He","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin Chen-Chuan","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2004,12]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/27633.27634"},{"key":"e_1_2_1_2_1","volume-title":"Mathematical Statistics: Basic Ideas and Selected Topics","author":"Bickel P. J.","year":"2001","unstructured":"P. J. Bickel and K. A. Doksum . Mathematical Statistics: Basic Ideas and Selected Topics . Prentice Hall , 2001 . P. J. Bickel and K. A. Doksum. Mathematical Statistics: Basic Ideas and Selected Topics. Prentice Hall, 2001."},{"key":"e_1_2_1_3_1","volume-title":"An Introduction to Mathematical Statistics","author":"Brunk H. D.","year":"1965","unstructured":"H. D. Brunk . An Introduction to Mathematical Statistics . New York , Blaisdell Pub. Co ., 1965 . H. D. Brunk. An Introduction to Mathematical Statistics. New York, Blaisdell Pub. Co., 1965."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031570.1031584"},{"key":"e_1_2_1_5_1","volume-title":"The UIUC web integration repository. Computer Science Department","author":"Chang K. C.-C.","year":"2003","unstructured":"K. C.-C. Chang , B. He , C. Li , and Z. Zhang . The UIUC web integration repository. Computer Science Department , University of Illinois at Urbana-Champaign. http :\/\/metaquerier.cs.uiuc.edu\/repository, 2003 . K. C.-C. Chang, B. He, C. Li, and Z. Zhang. The UIUC web integration repository. Computer Science Department, University of Illinois at Urbana-Champaign. http:\/\/metaquerier.cs.uiuc.edu\/repository, 2003."},{"key":"e_1_2_1_6_1","volume-title":"Conf. on Innovative Database Research","author":"Halevy A.","year":"2003","unstructured":"A. Halevy , O. Etzioni , A. Doan , Z. Ives , J. Madhavan , L. McDowell , and I. Tatarinov . Crossing the structure chasm . Conf. on Innovative Database Research , 2003 . A. Halevy, O. Etzioni, A. Doan, Z. Ives, J. Madhavan, L. McDowell, and I. Tatarinov. Crossing the structure chasm. Conf. on Innovative Database Research, 2003."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872784"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014071"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007612"},{"key":"e_1_2_1_11_1","volume-title":"VLDB Conference","author":"Madhavan J.","year":"2001","unstructured":"J. Madhavan , P. A. Bernstein , and E. Rahm . Generic schema matching with cupid . In VLDB Conference , 2001 . J. Madhavan, P. A. Bernstein, and E. Rahm. Generic schema matching with cupid. In VLDB Conference, 2001."},{"key":"e_1_2_1_12_1","volume-title":"VLDB","author":"Navathe S.","year":"1982","unstructured":"S. Navathe and S. Gadgil . A methodology for view integration in logical data base design . In VLDB , 1982 . S. Navathe and S. Gadgil. A methodology for view integration in logical data base design. In VLDB, 1982."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/1315451.1315525"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_2_1_15_1","volume-title":"Data integration: Where does the time go? Bulletin of the Tech. Committee on Data Engr., 25(3)","author":"Seligman L.","year":"2002","unstructured":"L. Seligman , A. Rosenthal , P. Lehner , and A. Smith . Data integration: Where does the time go? Bulletin of the Tech. Committee on Data Engr., 25(3) , 2002 . L. Seligman, A. Rosenthal, P. Lehner, and A. Smith. Data integration: Where does the time go? Bulletin of the Tech. Committee on Data Engr., 25(3), 2002."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007582"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/375663.375729"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1041410.1041414","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1041410.1041414","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:24:01Z","timestamp":1750267441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1041410.1041414"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["10.1145\/1041410.1041414"],"URL":"https:\/\/doi.org\/10.1145\/1041410.1041414","relation":{},"ISSN":["0163-5808"],"issn-type":[{"type":"print","value":"0163-5808"}],"subject":[],"published":{"date-parts":[[2004,12]]},"assertion":[{"value":"2004-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}