Database Engineering and Applications Symposium, International (2007)
Banff, Alberta, Canada
Sept. 6, 2007 to Sept. 8, 2007
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IDEAS.2007.16
Nitin Agarwal , Arizona State University, USA
Magdiel Galan Oliveras , Arizona State University, USA
Yi Chen , Arizona State University, USA
There is an increasing need for an XML query en- gine 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. How- ever, since not all subsequences correspond to valid tree structures, it is expensive to enumerate common sub- sequences between XML data and query and then fil- ter the invalid ones. XFinder addresses this challenge by detecting and pruning structurally irrelevant subse- quence matches as early as possible. Experiments show the efficiency of XFinder on various data and query sets.
M. G. Oliveras, N. Agarwal and Y. Chen, "Approximate Structural Matching over Ordered XML Documents," 2007 11th International Database Engineering and Applications Symposium, IDEAS-07(IDEAS), Banff, Alta., 2007, pp. 54-62.