By Topic

An Efficient XML query processing based on combining T-Bitmap and index techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yin-Fu Huang ; Grad. Sch. of Comput. Sci. & Inf. Eng., Nat. Yunlin Univ. of Sci. & Technol., Yunlin ; Shing-Hang Wang

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.

Published in:

Computers and Communications, 2008. ISCC 2008. IEEE Symposium on

Date of Conference:

6-9 July 2008