Similarity Flooding A Versatile Graph Matching Algorithm.pdf

Similarity Flooding: A Versatile Graph Matching Algorithm and its Application to Schema Matching  Sergey Melnik Hector Garcia-Molina Erhard Rahm Stanford University CA 94305 University of Leipzig, Germany fmelnik,hectorg@ rahm@informatik.uni-leipzig.de Abstract ing of relational schemas is required. Schema matching is utilized for a variety of other types of schemas including Matching elements of two data schemas or two data in- UML class taxonomies, ER diagrams, and ontologies. stances plays a key role in data warehousing, e-business, Matching of data instances is another important task. For or even biochemical applications. In this paper we present example, consider two CAD files or program scripts that a matching algorithm based on a fixpoint computation that have been independently modified by several developers. In is usable across different scenarios. The algorithm takes this scenario, matching helps identify moved or modified el- two graphs (schemas, catalogs, or other data structures) as ements in these complex data structures. In bioinformatics, input, and produces as output a mapping between corre- matching has been used for network analysis of molecular sponding nodes of the graphs. Depending on the matching interactions [9]. In this domain, data instances represent goal, a subset of the mapping is chosen using filters. After metabolic networks of chemical compounds, or molecular our algorithm runs