Matching Hierarchies Using Shared Objects

One of the main challenges in integrating two hierarchies is determining the correspondence between the edges of each hierarchy. Traditionally, this process, which we call hierarchy matching, is done by comparing the text associated with each edge. In this paper we instead use the placement of objects present in both hierarchies to infer how the hierarchies relate. We present two algorithms that, given a hierarchy with known facets (label-value pairs that define what objects are placed under an edge), determine feasible facets for a second hierarchy, based on shared objects. One algorithm is rule-based and the other is statisticsbased. In the experimental section, we compare the results of the two algorithms, and see how their performances vary based on the amount of noise in the hierarchies. Key words: data integration

• Type: Conference
• Year: 2008
• Where: ERCIMDL
• Authors: Robert Ikeda, Kai Zhao, Hector Garcia-Molina
• Keywords: Determine Feasible Facets, Education, ERCIMDL 2008, Hierarchies, Hierarchy Matching