PhD Thesis Proposal Defence


"Efficient Structural Query Processing in XML Databases"

By

Mr. Haifeng Jiang


Abstract

XML documents are typically queried with a combination of value
search and structure search. While querying by values can leverage
traditional database technologies, evaluating structural
relationships, specifically parent-child or ancestor-descendant
relationship, between XML element sets has imposed a great
challenge to efficient XML query processing. In this thesis, we
focus ourselves on the efficient structural query processing of
twig pattern matching for XML data. A structural join is
considered as a core operation in twig pattern matching. We have
proposed the XR-tree index and experimentally demonstrated that the
performance of a structural join between two XR-tree indexed element
sets is significantly better than existing approaches, by most
effectively skipping both ancestors and descendants without
matches. Based on this, we will explore the potential benefits of
index structures, especially the XR-tree index, for efficient matching
of twig patterns.


Date:				Thursday, 22 May 2003

Time:				1:00p.m.-3:00p.m.

Venue:				Room 1505
				Lifts 25-26

Committee Members:		Prof. Hongjun Lu (Supervisor)
				Prof. Frederick Lochovsky (Chairman)
				Dr. Qiong Luo
				Dr. Wilfred Ng


**** ALL are Welcome ****