7355

Practical and Theoretical Aspects of a Parallel Twig Join Algorithm for XML Processing using a GPGPU

Lila Shnaiderman, Oded Shmueli
Computer Science Department, Technion, Haifa 32000, Israel
Technical Report CS-2012-03

@article{shnaiderman2012practical,

   title={Practical and Theoretical Aspects of a Parallel Twig Join Algorithm for XML Processing using a GPGPU},

   author={Shnaiderman, L. and Shmueli, O.},

   year={2012}

}

Download Download (PDF)   View View   Source Source   

832

views

With an increasing amount of data and demand for fast query processing, the efficiency of database operations continues to be a challenging task. A common approach is to leverage parallel hardware platforms. With the introduction of general-purpose GPU (Graphics Processing Unit) computing, massively parallel hardware has become available within commodity hardware. XML is based on a tree-structured data model. Naturally, the most popular XML querying language (XPath) uses patterns of selection predicates on multiple elements, related by a tree structure. These are often abstracted by twig patterns. Finding all occurrences of such a (XML query) twig pattern in an XML document is a core operation for XML query processing. We present a new algorithm, GPU-Twig, for matching twig patterns in large XML documents, using a GPU. Our algorithm uses the data and task parallelism of the GPU to perform memory-intensive tasks whereas the CPU is used to perform I/O and resource management. We therefore efficiently exploit both the high-bandwidth GPU memory interface and the lower-bandwidth CPU main memory.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: