Publication: Windowed pq-grams for approximate joins of data-centric XML
Windowed pq-grams for approximate joins of data-centric XML
Date
Date
Date
Citations
Augsten, N., Böhlen, M., Dyreson, C., & Gamper, J. (2012). Windowed pq-grams for approximate joins of data-centric XML. VLDB Journal, 21(4), 463–488. https://doi.org/10.1007/s00778-011-0254-6
Abstract
Abstract
Abstract
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 lever
Additional indexing
Creators (Authors)
- Augsten, Nikolaus
- Dyreson, Curtis
- Gamper, Johann
Journal/Series Title
Journal/Series Title
Journal/Series Title
Volume
Volume
Volume
Number
Number
Number
Page range/Item number
Page range/Item number
Page range/Item number
Page end
Page end
Page end
Item Type
Item Type
Item Type
In collections
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Dewey Decimal Classifikation
Scope
Scope
Scope
Language
Language
Language
Publication date
Publication date
Publication date
Date available
Date available
Date available
ISSN or e-ISSN
ISSN or e-ISSN
ISSN or e-ISSN
Additional Information
Additional Information
Additional Information
OA Status
OA Status
OA Status
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Citations
Augsten, N., Böhlen, M., Dyreson, C., & Gamper, J. (2012). Windowed pq-grams for approximate joins of data-centric XML. VLDB Journal, 21(4), 463–488. https://doi.org/10.1007/s00778-011-0254-6
