Efficient Processing of XML Keyword Queries based on DFDewey Labeling Scheme

To find matched results for a keyword query on XML data, Dewey labeling scheme is usually applied to nodes of the underlying data for efficient computation. Unfortunately, the cost of the two basic operations, i.e., testing the positional relationships and computing the Lowest Common Ancestor (LCA) of two nodes, is linear to the height of the given XML tree and difficult to make optimization. The authors propose a new Depth First Dewey labeling (DFDewey) scheme to accelerate the computation of matched results.

Provided by: AICIT Topic: Big Data Date Added: Mar 2013 Format: PDF

Find By Topic