10 search results - page 1 / 2 » Similarity Flooding: A Versatile Graph Matching Algorithm an... |
ICDE
2002
IEEE
14 years 6 months ago
2002
IEEE
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...
IBIS
2006
13 years 5 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
FLAIRS
2004
13 years 6 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
SEMWEB
2009
Springer
13 years 11 months ago
2009
Springer
Our ontology schema matching algorithm takes the essence of the locality of reference by considering the neighboring concepts and relations to align the entities of ontologies. It ...
JCDL
2004
ACM
13 years 10 months ago
2004
ACM
Concept maps (CM) are informal, semantic, node-link conceptual graphs used to represent knowledge in a variety of applications. Algorithms that compare concept maps would be usefu...