Abstract
Skeletal parallelism encourages us to develop parallel programs by composing ready-made components called parallel skeletons. In this paper, we propose a parallel implementation of XPath queries by using parallel tree skeletons. Since the parallel tree skeletons are implemented efficiently in parallel for trees of any shape, our implementation of XPath queries has demonstrated good scalability even for the ill-balanced XML trees.
