Sciweavers

Share
VLDB
2005
ACM

Approximate Matching of Hierarchical Data Using pq-Grams

11 years 10 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases structural information is available and can be used to match such data. As a running example we use residential address information. Addresses are hierarchical structures and are present in many databases. Often they are the best, if not only, relationship between autonomous data sources. Typically the matching has to be approximate since the representations in the sources differ. We propose pq-grams to approximately match hierarchical information from autonomous sources. We define the pq-gram distance between ordered labeled trees as an effective and efficient approximation of the well-known tree edit distance. We analyze the properties of the pq-gram distance and compare it with the edit distance and alternative approximations. Experiments with synthetic and real world data confirm the analytic results and...
Nikolaus Augsten, Michael H. Böhlen, Johann G
Added 28 Jun 2010
Updated 28 Jun 2010
Type Conference
Year 2005
Where VLDB
Authors Nikolaus Augsten, Michael H. Böhlen, Johann Gamper
Comments (0)
books