{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,8]],"date-time":"2026-09-08T13:00:33Z","timestamp":1788872433026,"version":"build-2803163510"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2013,4,1]],"date-time":"2013-04-01T00:00:00Z","timestamp":1364774400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000180","name":"U.S. Department of Homeland Security","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000180","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000105","name":"Office of Cyberinfrastructure","doi-asserted-by":"publisher","award":["OCI-0821527"],"award-info":[{"award-number":["OCI-0821527"]}],"id":[{"id":"10.13039\/100000105","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Visual Analytics for Command, Control, and Interoperability Environments"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2013,4]]},"abstract":"<jats:p>Schema matching and value mapping across two information sources, such as databases, are critical information aggregation tasks. Before data can be integrated from multiple tables, the columns and values within the tables must be matched. The complexities of both these problems grow quickly with the number of attributes to be matched and due to multiple semantics of data values. Traditional research has mostly tackled schema matching and value mapping independently, and for categorical (discrete-valued) attributes. We propose novel methods that leverage value mappings to enhance schema matching in the presence of opaque column names for schemas consisting of both continuous and discrete-valued attributes. An additional source of complexity is that a discrete-valued attribute in one schema could in fact be a quantized, encoded version of a continuous-valued attribute in the other schema. In our approach, which can tackle both \u201conto\u201d and bijective schema matching, the fitness objective for matching a pair of attributes from two schemas exploits the statistical distribution over values within the two attributes. Suitable fitness objectives are based on Euclidean-distance and the data log-likelihood, both of which are applied in our experimental study. A heuristic local descent optimization strategy that uses two-opt switching to optimize attribute matches, while simultaneously embedding value mappings, is applied for our matching methods. Our experiments show that the proposed techniques matched mixed continuous and discrete-valued attribute schemas with high accuracy and, thus, should be a useful addition to a framework of (semi) automated tools for data alignment.<\/jats:p>","DOI":"10.1145\/2445583.2445585","type":"journal-article","created":{"date-parts":[[2013,4,23]],"date-time":"2013-04-23T09:04:26Z","timestamp":1366707866000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Schema matching and embedded value mapping for databases with opaque column names and mixed continuous and discrete-valued data fields"],"prefix":"10.1145","volume":"38","author":[{"given":"Anuj","family":"Jaiswal","sequence":"first","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David J.","family":"Miller","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Prasenjit","family":"Mitra","sequence":"additional","affiliation":[{"name":"The Pennsylvania State University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,4,26]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100705"},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 28th International Conference on Very Large Data Bases. VLDB Endowment, 586--597","author":"Ananthakrishna R.","unstructured":"Ananthakrishna , R. , Chaudhuri , S. , and Ganti , V . 2002. Eliminating fuzzy duplicates in data warehouses . In Proceedings of the 28th International Conference on Very Large Data Bases. VLDB Endowment, 586--597 . Ananthakrishna, R., Chaudhuri, S., and Ganti, V. 2002. Eliminating fuzzy duplicates in data warehouses. In Proceedings of the 28th International Conference on Very Large Data Bases. VLDB Endowment, 586--597."},{"key":"e_1_2_1_3_1","first-page":"452","article-title":"Database schema matching using machine learning with feature selection. In Advanced Information Systems Engineering","volume":"2348","author":"Berlin J.","year":"2006","unstructured":"Berlin , J. and Motro , A. 2006 . Database schema matching using machine learning with feature selection. In Advanced Information Systems Engineering . Lecture Notes in Computer Science , vol. 2348 , Spring er, 452 -- 466 . Berlin, J. and Motro, A. 2006. Database schema matching using machine learning with feature selection. In Advanced Information Systems Engineering. Lecture Notes in Computer Science, vol. 2348, Springer, 452--466.","journal-title":"Lecture Notes in Computer Science"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"695","DOI":"10.14778\/3402707.3402710","article-title":"Generic schema matching, ten years later","volume":"4","author":"Bernstein P.","year":"2011","unstructured":"Bernstein , P. , Madhavan , J. , and Rahm , E. 2011 . Generic schema matching, ten years later . Proc. VLDB Endow. 4 , 11, 695 -- 701 . Bernstein, P., Madhavan, J., and Rahm, E. 2011. Generic schema matching, ten years later. Proc. VLDB Endow. 4, 11, 695--701.","journal-title":"Proc. VLDB Endow."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment, 1167--1170","author":"Bernstein P.","unstructured":"Bernstein , P. , Melnik , S. , and Churchill , J . 2006. Incremental schema matching . In Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment, 1167--1170 . Bernstein, P., Melnik, S., and Churchill, J. 2006. Incremental schema matching. In Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment, 1167--1170."},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley-Interscience. Cover T. M. and Thomas J. A. 1991. Elements of Information Theory. Wiley-Interscience.","DOI":"10.1002\/0471200611"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"e_1_2_1_8_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster A.","year":"1977","unstructured":"Dempster , A. , Laird , N. , and Rubin , D. 1977 . Maximum likelihood from incomplete data via the EM algorithm . J. R. Statistical Soc. B 39 , 1, 1 -- 38 . Dempster, A., Laird, N., and Rubin, D. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statistical Soc. B 39, 1, 1--38.","journal-title":"J. R. Statistical Soc. B"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/648032.744063"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/376284.375731"},{"key":"e_1_2_1_12_1","first-page":"1","article-title":"Semantic integration research in the database community: A brief survey","volume":"26","author":"Doan A.","year":"2005","unstructured":"Doan , A. and Halevy , A. 2005 . Semantic integration research in the database community: A brief survey . AI Mag. 26 , 1 , 83. Doan, A. and Halevy, A. 2005. Semantic integration research in the database community: A brief survey. AI Mag. 26, 1, 83.","journal-title":"AI Mag."},{"key":"e_1_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Everitt B. and Hand D. 1981. Finite Mixture Distributions. Chapman & Hall London. Everitt B. and Hand D. 1981. Finite Mixture Distributions. Chapman & Hall London.","DOI":"10.1007\/978-94-009-5897-5"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s003579900058"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2167832.2167838"},{"key":"e_1_2_1_16_1","volume-title":"Enhancing the capabilities of attribute correspondences","author":"Gal A.","unstructured":"Gal , A. 2011. Enhancing the capabilities of attribute correspondences . In Schema Matching and Mapping, Z. Bellahsene, A. Bonifati, and E. Rahm, Eds., Springer , 53--73. Gal, A. 2011. Enhancing the capabilities of attribute correspondences. In Schema Matching and Mapping, Z. Bellahsene, A. Bonifati, and E. Rahm, Eds., Springer, 53--73."},{"key":"e_1_2_1_17_1","volume-title":"Proceedings of the 19th International Conference on Data Engineering. 729--731","author":"Gravano L.","unstructured":"Gravano , L. , Ipeirotis , P. G. , Koudas , N. , and Srivastava , D . 2003. Text joins for data cleansing and integration in an RDBMs . In Proceedings of the 19th International Conference on Data Engineering. 729--731 . Gravano, L., Ipeirotis, P. G., Koudas, N., and Srivastava, D. 2003. Text joins for data cleansing and integration in an RDBMs. In Proceedings of the 19th International Conference on Data Engineering. 729--731."},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment","author":"Halevy A.","unstructured":"Halevy , A. , Rajaraman , A. , and Ordille , J . 2006. Data integration: the teenage years . In Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment , New York, NY, 9--16. Halevy, A., Rajaraman, A., and Ordille, J. 2006. Data integration: the teenage years. In Proceedings of the 32nd International Conference on Very Large Data Bases. VLDB Endowment, New York, NY, 9--16."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Harris J. and St\u00f6cker H. 1998. Handbook of Mathematics and Computational Science. Birkh\u00e4user. Harris J. and St\u00f6cker H. 1998. Handbook of Mathematics and Computational Science. Birkh\u00e4user.","DOI":"10.1007\/978-1-4612-5317-4"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223807"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.69"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099569"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/11581062_46"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.100"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872783"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223897"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.129"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 27th International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc.","author":"Madhavan J.","unstructured":"Madhavan , J. , Bernstein , P. A. , and Rahm , E . 2001. Generic schema matching with cupid . In Proceedings of the 27th International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc. , San Francisco, CA, 49--58. Madhavan, J., Bernstein, P. A., and Rahm, E. 2001. Generic schema matching with cupid. In Proceedings of the 27th International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., San Francisco, CA, 49--58."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347123"},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"McLachlan G. and Krishnan T. 2008. The EM Algorithm and Extensions. John Wiley & Sons. McLachlan G. and Krishnan T. 2008. The EM Algorithm and Extensions. John Wiley & Sons.","DOI":"10.1002\/9780470191613"},{"key":"e_1_2_1_31_1","unstructured":"McLachlan G. and Peel D. 2004. Finite Mixture Models. John Wiley & Sons. McLachlan G. and Peel D. 2004. Finite Mixture Models. John Wiley & Sons."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781119995678"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the 24rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., 122--133","author":"Milo T.","unstructured":"Milo , T. and Zohar , S . 1998. Using schema matching to simplify heterogeneous data translation . In Proceedings of the 24rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., 122--133 . Milo, T. and Zohar, S. 1998. Using schema matching to simplify heterogeneous data translation. In Proceedings of the 24rd International Conference on Very Large Data Bases. Morgan Kaufmann Publishers Inc., 122--133."},{"key":"e_1_2_1_34_1","first-page":"32","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres J.","year":"1957","unstructured":"Munkres , J. 1957 . Algorithms for the assignment and transportation problems . J. SIAM 5 , 1, 32 -- 38 . Munkres, J. 1957. Algorithms for the assignment and transportation problems. J. SIAM 5, 1, 32--38.","journal-title":"J. SIAM"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687649"},{"key":"e_1_2_1_36_1","volume-title":"Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 2633--2638","author":"N\u00fa\u00f1ez P.","unstructured":"N\u00fa\u00f1ez , P. , Drews , P. , Bandera , A. , Rocha , R. , Campos , M. , and Dias , J . 2010. Change detection in 3d environments based on Gaussian mixture model and robust structural matching for autonomous robotic applications . In Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 2633--2638 . N\u00fa\u00f1ez, P., Drews, P., Bandera, A., Rocha, R., Campos, M., and Dias, J. 2010. Change detection in 3d environments based on Gaussian mixture model and robust structural matching for autonomous robotic applications. In Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 2633--2638."},{"key":"e_1_2_1_37_1","unstructured":"Peukert E. Massmann S. and Koenig K. 2010. Comparing similarity combination methods for schema matching. GI Jahrestagung 1 175 692--701. Peukert E. Massmann S. and Koenig K. 2010. Comparing similarity combination methods for schema matching. GI Jahrestagung 1 175 692--701."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966865.1966872"},{"key":"e_1_2_1_39_1","first-page":"10","article-title":"R: A language and environment for statistical computing","volume":"1","author":"Development Core Team","year":"2010","unstructured":"R Development Core Team . 2010 . R: A language and environment for statistical computing . Vienna Austria R Foundation for Statistical Computing 1 , 10 , 2673. R Development Core Team. 2010. R: A language and environment for statistical computing. Vienna Austria R Foundation for Statistical Computing 1, 10, 2673.","journal-title":"Vienna Austria R Foundation for Statistical Computing"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780100057"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176344136"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPWRS.2009.2030271"},{"key":"e_1_2_1_43_1","volume-title":"Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 4424--4431","author":"Steinberg D.","unstructured":"Steinberg , D. , Williams , S. , Pizarro , O. , and Jakuba , M . 2010. Towards autonomous habitat classification using gaussian mixture models . In Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 4424--4431 . Steinberg, D., Williams, S., Pizarro, O., and Jakuba, M. 2010. Towards autonomous habitat classification using gaussian mixture models. In Proceedings of the International Conference on Intelligent Robots and Systems. IEEE, 4424--4431."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.6778"},{"key":"e_1_2_1_45_1","volume-title":"Statistical Research Division","author":"Winkler W.","unstructured":"Winkler , W. 1999. The state of record linkage and current research problems. Tech. rep ., Statistical Research Division , US Bureau of the Census, Wachington, DC. Winkler, W. 1999. The state of record linkage and current research problems. Tech. rep., Statistical Research Division, US Bureau of the Census, Wachington, DC."}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2445583.2445585","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2445583.2445585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:34:09Z","timestamp":1750224849000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2445583.2445585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,4]]}},"alternative-id":["10.1145\/2445583.2445585"],"URL":"https:\/\/doi.org\/10.1145\/2445583.2445585","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"value":"0362-5915","type":"print"},{"value":"1557-4644","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4]]},"assertion":[{"value":"2011-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-10-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-04-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}