Quick Search:

uzh logo
Browse by:

Zurich Open Repository and Archive

Maintenance: Tuesday, 5.7.2016, 07:00-08:00

Maintenance work on ZORA and JDB on Tuesday, 5th July, 07h00-08h00. During this time there will be a brief unavailability for about 1 hour. Please be patient.

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

Augsten, Nikolaus; Böhlen, Michael H; Dyreson, Curtis; Gamper, Johann (2012). Windowed pq-grams for approximate joins of data-centric XML. VLDB Journal, 21(4):463-488.

[img]Published Version
PDF - Registered users only
View at publisher
Published Version


In data integration applications, a join matches elements that are common to two data sources. Since elements are represented slightly different in each source, an approximate join must be used to do the matching. For XML data, most existing approximate join strategies are based on some ordered tree matching technique, such as the tree edit distance. In data-centric XML, however, the sibling order is irrelevant, and two elements should match even if their subelement order varies. Thus, approximate joins for data-centric XML must leverage unordered tree matching techniques. This is computationally hard since the algorithms cannot rely on a predefined sibling order. In this paper, we give a solution for approximate joins based on unordered tree matching. The core of our solution are windowed pq-grams which are small subtrees of a specific shape. We develop an efficient technique to generate windowed pq-grams in a three-step process: sort the tree, extend the sorted tree with dummy nodes, and decompose the extended tree into windowed pq-grams. The windowed pq-grams distance between two trees is the number of pq-grams that are in one tree decomposition only. We show that our distance is a pseudo-metric and empirically demonstrate that it effectively approximates the unordered tree edit distance. The approximate join using windowed pq-grams can be efficiently implemented as an equality join on strings, which avoids the costly computation of the distance between every pair of input trees. Experiments with synthetic and real world data confirm the analytic results and show the effectiveness and efficiency of our technique.


4 citations in Web of Science®
5 citations in Scopus®
Google Scholar™



125 downloads since deposited on 09 Feb 2012
33 downloads since 12 months

Detailed statistics

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:03 Faculty of Economics > Department of Informatics
Dewey Decimal Classification:000 Computer science, knowledge & systems
Deposited On:09 Feb 2012 11:36
Last Modified:05 Apr 2016 15:26
ISSN:1066-8888 (P) 0949-877X (E)
Additional Information:The original publication is available at www.springerlink.com
Publisher DOI:10.1007/s00778-011-0254-6
Other Identification Number:merlin-id:6181

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

Repository Staff Only: item control page