Processing XPath Structural Constraints on GPU



XPath queries, XML, GPU


Technologies such as CUDA and OpenCL have popularized the usage of graphics cards (GPUs) for general purpose programming, often with impressive performance gains. However, using such cards for speeding up XML Databases processing is yet to be fully explored. XML databases offer much flexibility for Web-oriented systems. Nonetheless, such flexibility comes at a considerable computational cost. This work shows how graphics cards can be leveraged to reduce the computational cost of processing an important subset of XPath queries. It presents an algorithm designed to consider the cost model of GPUs and to evaluate queries efficiently. An experimental study reveals that this algorithm is more efficient than implementations of a similar strategy on CPU for all the datasets tested. The speedups with respect to exist-db, a popular XML database system, are as high as two orders of magnitude.


Download data is not yet available.

Author Biography

Mirella M. Moro, UFMG

Mirella M. Moro is an assistant professor at the Computer Science department at UFMG (Belo Horizonte, Brazil). She holds a Ph.D. in Computer Science (University of California Riverside - UCR, 2007), and MSc and BSc in Computer Science as well (UFRGS, Brazil, 2001, 1999). She is the Education Director of SBC (Brazilian Computer Society) and is the editor-in-chief of the new electronic magazine SBC Horizontes, which focuses on career in Computer Science. She is also a member of the ACM Education Council, ACM SIGMOD, ACM SIGCSE, ACM-W, IEEE, IEEE WIE, and MentorNet. Mirella has been working with research in Computer Science in the area of Databases since 1997. Her research interests include hybrid XML/relational modeling, XML query optimization, stream processing, content-based dissemination systems, temporal databases, versioning management, and schema evolution.


Additional Files





SBBD 2012 Short Papers