Approximate structural matching over ordered XML documents

Nitin Agarwal, Magdiel Galan Oliveras, Yi Chen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

There is an increasing need for an XML query engine that not only searches for exact matches to a query but also returns "query-like" structures. We have designed and developed XFinder, an efficient top K tree pattern query evaluation system, which reduces the problem of approximate tree structural matching to a simpler problem of subsequence matching. However, since not all subsequences correspond to valid tree structures, it is expensive to enumerate common subsequences between XML data and query and then filter the invalid ones. XFinder addresses this challenge by detecting and pruning structurally irrelevant subsequence matches as early as possible. Experiments show the efficiency of XFinder on various data and query sets.

Original languageEnglish (US)
Title of host publication11th International Database Engineering and Applications Symposium Proceedings, IDEAS
Pages54-62
Number of pages9
DOIs
StatePublished - Dec 1 2007
Externally publishedYes
Event11th International Database Engineering and Applications Symposium - IDEAS'2007 - Banff, AB, Canada
Duration: Sep 6 2007Sep 8 2007

Publication series

NameProceedings of the International Database Engineering and Applications Symposium, IDEAS
ISSN (Print)1098-8068

Other

Other11th International Database Engineering and Applications Symposium - IDEAS'2007
CountryCanada
CityBanff, AB
Period9/6/079/8/07

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Approximate structural matching over ordered XML documents'. Together they form a unique fingerprint.

Cite this