Quick Search:

is currently disabled due to reindexing of the ZORA database. Please use Advanced Search.
uzh logo
Browse by:
bullet
bullet
bullet
bullet

Zurich Open Repository and Archive 

Permanent URL to this publication: http://dx.doi.org/10.5167/uzh-56101

Augsten, Nikolaus; Böhlen, Michael H; Gamper, Johann (2005). Approximate matching of hierarchical data using pq-grams. In: 31st International Conference on Very Large Data Bases, Trondheim, Norway, 30 August 2005 - 2 September 2005, 301-312.

[img]Published Version
PDF - Registered users only
252kB

Abstract

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.

Item Type:Conference or Workshop Item (Paper), refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
DDC:000 Computer science, knowledge & systems
Event End Date:2 September 2005
Deposited On:29 May 2012 08:55
Last Modified:17 Oct 2012 15:42
Publisher:VLDB Endowment
Series Name:VLDB '05
ISBN:1-59593-154-6
Official URL:http://dl.acm.org/citation.cfm?id=1083592.1083630
Related URLs:http://www.vldb2005.org/
Other Identification Number:merlin-id:5868
Citations:Google Scholar™
Scopus®. Citation Count: 38

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page