Publication: Approximate Joins for Data-Centric XML
Approximate Joins for Data-Centric XML
Date
Date
Date
Citations
Augsten, N., Böhlen, M., Dyreson, C., & Gamper, J. (2008). Approximate Joins for Data-Centric XML. 814–823. https://doi.org/10.1109/ICDE.2008.4497490
Abstract
Abstract
Abstract
In data integration applications, a join matches elements thatare common to two data sources. Often, however, elements are represented slightly different in each source, so an approximate join must be used. For XML data, most approximate join strategies are based on some ordered tree matching technique. But in data-centric XML the order is irrelevant: two elements should match even if their subelement order varies. In this paper we give a solution for the approximate join of unordered trees. Our solution is based on windowed pq-grams.
Metrics
Downloads
Views
Additional indexing
Creators (Authors)
- Augsten, Nikolaus
- Dyreson, Curtis
- Gamper, Johann
Event Title
Event Title
Event Title
Event Location
Event Location
Event Location
Event Country
Event Country
Event Country
Event Start Date
Event Start Date
Event Start Date
Event End Date
Event End Date
Event End Date
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
Date available
Date available
Date available
OA Status
OA Status
OA Status
Free Access at
Free Access at
Free Access at
Publisher DOI
Other Identification Number
Other Identification Number
Other Identification Number
Metrics
Downloads
Views
Citations
Augsten, N., Böhlen, M., Dyreson, C., & Gamper, J. (2008). Approximate Joins for Data-Centric XML. 814–823. https://doi.org/10.1109/ICDE.2008.4497490
