Zurich Open Repository and Archive (University of Zurich) · 2005 · 74 citations · 28 references
ComputingComputer ScienceData MiningDatabasesNatural Language ProcessingData IntegrationQuery ProcessingString AlgorithmsAnalytic ApproximationsApproximate MatchingData MatchingEdit DistanceHierarchical StructuresSimilarity DetectionTree Distance MetricsWord N-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 the scalability of our approach.
28
Storing and querying ordered XML using a relational database system
Igor Tatarinov, Stratis D. Viglas, Kevin Beyer et al. · 2002 · 2.3K citations
Nicolas Bruno, Nick Koudas, Divesh Srivastava · 2002 · 876 citations
The Tree-to-Tree Correction Problem
Kuo‐Chung Tai · Journal of the ACM · 1979 · 863 citations · Full text
On supporting containment queries in relational database management systems
Chun Zhang, Jeffrey F. Naughton, David J. DeWitt et al. · 2001 · 785 citations