Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching

Abstract

Matching elements of two data schemas or two data instances plays a key role in data warehousing, e-business, or even biochemical applications. In this paper we present a matching algorithm based on a fixpoint computation that is usable across different scenarios. The algorithm takes two graphs (schemas, catalogs, or other data structures) as input, and… (More)
DOI: 10.1109/ICDE.2002.994702
View Slides

Topics

14 Figures and Tables

Statistics

050100'03'05'07'09'11'13'15'17
Citations per Year

1,204 Citations

Semantic Scholar estimates that this publication has 1,204 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics