Paper Info
Title
An efficient parallel pathstack algorithm for processing XML twig queries on multi-core systems
Abstract
Multi-cores are more and more popular recently and have being altered the course of computing. Traditional XPath query evaluation algorithms cannot take full advantages of multi-cores, and it is not straightforward to adapt such algorithms on multi-cores. In this paper, we propose an efficient parallel PathStack algorithm, named P-PathStack, for processing XML twig queries. The algorithm first efficiently partitions input element lists into multiple buckets, and then processes data in each bucket in parallel. With efficient partitioning method, our proposed algorithm can avoid many useless elements and achieve very good speedup ratio. We have implemented the algorithm and experimental results show that it achieves high performance and speedup ratio.
Year
DOI
Venue
2010
10.1007/978-3-642-12026-8_22
DASFAA
Keywords
Field
DocType
xml twig query,multi-core system,traditional xpath query evaluation,efficient parallel pathstack algorithm,full advantage,good speedup ratio,high performance,speedup ratio,proposed algorithm,efficient partitioning method
Twig,XML,Parallel algorithm,Computer science,Algorithm,Theoretical computer science,XPath,Partition (number theory),Multi-core processor,Database,Speedup
Conference
Volume
ISSN
ISBN
5981
0302-9743
3-642-12025-3
Citations 
PageRank 
References 
4
0.44
22
Authors
5
Name
Order
Citations
PageRank
Jianhua Feng12713121.30
Le Liu27011.08
Guoliang Li33077154.70
Jianhui Li414631.34
Yuanhao Sun5522.84