Comparison of Schema Matching Evaluations Export

@book{citeulike:224757, abstract = { Recently, <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> has found considerable interest in both research and practice. Determining <SPAN style='background:silver;'>matching</SPAN> components of database or XML <SPAN style='background:silver;'>schema</SPAN>s is needed in many applications, e.g. for E-business and data integration. Various <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> systems have been developed to solve the problem semi-automatically. While there have been some evaluations, the overall effectiveness of currently available automatic <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> systems is largely unclear. This is because the evaluations were conducted in diverse ways making it difficult to assess the effectiveness of each single system, let alone to compare their effectiveness. In this paper we survey recently published <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> evaluations. For this purpose, we introduce the major criteria that influence the effectiveness of a <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> approach and use these criteria to compare the various systems. Based on our observations, we discuss the requirements for future match implementations and evaluations.}, author = {Do, Hong-Hai and Melnik, Sergey and Rahm, Erhard}, citeulike-article-id = {224757}, citeulike-linkout-0 = {http://www.metapress.com/content/4WBXB1JBW8W4EK9V}, journal = {Lecture Notes in Computer Science}, keywords = {matching, schema}, month = {January}, pages = {221--237}, posted-at = {2005-06-10 01:02:47}, priority = {0}, title = {Comparison of Schema Matching Evaluations}, url = {http://www.metapress.com/content/4WBXB1JBW8W4EK9V}, volume = {2593}, year = {2003} }

TY - BOOK ID - citeulike:224757 L3 - citeulike-article-id:224757 N2 - Recently, <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> has found considerable interest in both research and practice. Determining <SPAN style='background:silver;'>matching</SPAN> components of database or XML <SPAN style='background:silver;'>schema</SPAN>s is needed in many applications, e.g. for E-business and data integration. Various <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> systems have been developed to solve the problem semi-automatically. While there have been some evaluations, the overall effectiveness of currently available automatic <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> systems is largely unclear. This is because the evaluations were conducted in diverse ways making it difficult to assess the effectiveness of each single system, let alone to compare their effectiveness. In this paper we survey recently published <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> evaluations. For this purpose, we introduce the major criteria that influence the effectiveness of a <SPAN style='background:silver;'>schema</SPAN> <SPAN style='background:silver;'>matching</SPAN> approach and use these criteria to compare the various systems. Based on our observations, we discuss the requirements for future match implementations and evaluations. JF - Lecture Notes in Computer Science EP - 237 TI - Comparison of Schema Matching Evaluations VL - 2593 SP - 221 KW - matching KW - schema AU - Do, Hong-Hai AU - Melnik, Sergey AU - Rahm, Erhard PY - 2003/01// UR - http://www.metapress.com/content/4WBXB1JBW8W4EK9V ER -