Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12]

@

Journal of Information Science and Engineering, Vol. 28 No. 2, pp. 221-242 (March 2012)

Processing XML Queries with Structural and Full-Text Constraints

YA-HUI CHANG, CHENG-YI WU AND CHENG-CHENG LO
Department of Computer Science and Engineering
National Taiwan Ocean University
Keelung, 202 Taiwan
E-mail: yahui@ntou.edu.tw

Efficient query processing on XML data is an important task for querying the data web. In this paper, we consider the XML query which can be represented as a query tree with twig patterns, and also consists of complex full-text constraints. Two approaches are proposed. The structure-first approach will first identify the elements which satisfy the tag constraint, and then process the full-text constraint on the terms represented within each element. The satisfied elements will be combined to meet the complete twig constraints. On the other hand, the keyword-first approach will first identify the elements which represent the required keywords, and then return the elements which satisfy the given full-text predicates and structural constraints. We demonstrate, via an extensive experimental study, that the two approaches have their own merits.

Keywords: XML, query processing, structural constraints, full-text predicates, keywordbased search

Full Text () Retrieve PDF document (201203_01.pdf)

Received August 20, 2010; revised December 30, 2010; accepted February 23, 2011.
Communicated by Tyng-Luh Liu.