Skip to Main Content
With the widespread use of the Extensible Markup Language (XML), more and more applications store and query XML documents in XML database systems. So how to efficiently process a query and find specified patterns from XML documents is a crucial issue. In the paper, we proposed an efficient query processing algorithm for XML documents. We build T-Bitmap for each element in an XML document to filter out useless nodes. Moreover, we also build tag-index and value-index to improve the search efficiency while processing the ancestor-descendant axis and value nodes. Finally, through the experiments, we compared our method with others, and found that our method has better performances than others.
Date of Conference: 6-9 July 2008