Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Schema matching

Schema matching aims at identifying semantic correspondences between metadata structures or models, such as database schemas, XML message formats, and ontologies. Solving such match problems is a key task in numerous application fields, particularly to support data exchange, schema evolution, and virtually all kinds of data integration. Unfortunately, the typically high degree of semantic heterogeneity reflected in different schemas makes schema matching an inherently complex task. Hence, most current systems still require the manual specification of semantic correspondences, e.g., with the help of a GUI. While such an approach is appropriate for... Schema matching aims at identifying semantic correspondences between metadata structures or models, such as database schemas, XML message formats, and ontologies. Solving such match problems is a key task in numerous application fields, particularly to support data exchange, schema evolution, and virtually all kinds of data integration. Unfortunately, the typically high degree of semantic heterogeneity reflected in different schemas makes schema matching an inherently complex task. Hence, most current systems still require the manual specification of semantic correspondences, e.g., with the help of a GUI. While such an approach is appropriate for...
Z. Bellahsene et at. (eds.), Schema Matching and Mapping, Data-Centric Systems and Applications, DOI 10.1007/978-3-642-16518-4.1,... [Pg.4]

F-Measure combines Recall and Precision, two standard measures to evaluate the effectiveness of schema matching approaches (Do et al. 2003). [Pg.6]

The standard approach for pairwise schema matching is to compare every element of the first schema with every element with the second schema to determine matching schema elements, i.e., evaluation of the cross join. Such an approach has at least a quadratic complexity with respect to schema size and does not scale well. There are not only efficiency problems for large schemas but the large search space makes it also very difficult to correctly identify matching element pairs. Hence, it is important for large match tasks to reduce the search space in order to improve at least efficiency and, potentially, match quality. [Pg.12]

To further illustrate the state of the art, we discuss in this section the schema matching capabilities in commercial tools as well as in selected research prototypes. For better comparability, we restrict ourselves on systems for pairwise schema matching. [Pg.21]

The increasing support in commercial tools underlines the high practical importance of automatic schema matching. However, the tools need much further improvement to reduce the manual mapping effort especially for large match tasks. For example, commercial tools do neither support structural matching nor any of the advanced techniques discussed in Sect. 3. [Pg.21]

Do HH, Rahm E (2002) COMA - A System for Flexible Combination of Schema Matching Approaches. Proceedings VLDB Conf., pp 610-621 Do HH, Rahm E (2007) Matching large schemas Approaches and evaluation. Inf Syst 32(6) 857-885... [Pg.26]

Do HH, Melnik S, Rahm E (2003) Comparison of schema matching evaluations. In web, web-services, and database systems, LNCS, vol 2593. Springer, Heidelberg Doan A, Madhavan J, Dhamankar R, Domingos P, Halevy AY (2003) Learning to match ontologies on the semantic web. VLDB J 12(4) 303-319... [Pg.26]

Falconer SM, Noy NF (2011) Interactive techniques to support ontology mapping. In Bellahsene Z, Bonifati A, Rahm E (eds) Schema matching and mapping. Data-Centric Systems and Applications Series. Springer, Heidelberg... [Pg.26]

Lee Y, Sayyadian M, Doan A, Rosenthal A (2007) eTuner Tuning schema matching software using synthetic scenarios. VLDB J 16(1) 97-122 Li J, Tang J, Li Y, Luo Q (2009) RiMOM A dynamic multistrategy ontology alignment framework. IEEE Trans Knowl Data Eng 21(8) 1218—1232... [Pg.27]

Madhavan J, Bernstein P A, Rahm E (2001) Generic Schema Matching with Cupid. In Proceedings VLDB Conf., pp 49-58... [Pg.27]

Rahm E, Bernstein PA (2001) A survey of approaches to automatic schema matching. VLDB J 10(4)334-350... [Pg.27]

These are just a few of the visual and interactive tools available for ontology matching. In the next section, we discuss similar tools that have been developed to support the related problem of schema matching. [Pg.38]

See other pages where Schema matching is mentioned: [Pg.4]    [Pg.5]    [Pg.5]    [Pg.6]    [Pg.6]    [Pg.6]    [Pg.7]    [Pg.8]    [Pg.9]    [Pg.11]    [Pg.12]    [Pg.13]    [Pg.17]    [Pg.18]    [Pg.19]    [Pg.20]    [Pg.20]    [Pg.21]    [Pg.21]    [Pg.23]    [Pg.25]    [Pg.25]    [Pg.25]    [Pg.25]    [Pg.25]    [Pg.26]    [Pg.26]    [Pg.26]    [Pg.27]    [Pg.27]    [Pg.27]    [Pg.28]    [Pg.28]    [Pg.31]    [Pg.31]    [Pg.32]    [Pg.38]   
See also in sourсe #XX -- [ Pg.38 , Pg.39 , Pg.40 , Pg.41 , Pg.254 , Pg.293 , Pg.295 , Pg.297 , Pg.299 , Pg.301 , Pg.303 , Pg.305 , Pg.307 , Pg.309 , Pg.311 , Pg.313 , Pg.315 ]



SEARCH



Schema

© 2024 chempedia.info