Constructing Path Dictionary with Suffix Trees to Speed up XML Query Evaluation

The importance of suffix trees is underlined by the fact that new discoveries about them are made repeatedly in the past years. Despite their simple data structure, many complicated problems can be solved in linear time with suffix trees. So they are intensively employed in pattern matching on string and trees. A lot of indexing and query schemes for XML data have been proposed, but the problem of efficiency still remain as an open research issue. We construct a suffix tree of a trie which encodes all path patterns exists in the XML database. We call this suffix tree the XML path dictionary. We can see that the XML path dictionary can be construct on line. The algorithm to construct such an XML path dictionary is given. The whole indexing method and query processing scheme are presented as well as the discussion for processing RPE. The XML path dictionary is used to speed up path query.