![Multi-Core Processing of XML Twig Patterns
Abstract:
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, which often may be
abstracted by twig patterns. Finding all occurrences of such a twig pattern
in an XML database is a basic operation for XML query processing. We
present the parallel path stack algorithm (PPS) and the parallel twig stack
algorithm (PTS). PPS and PTS are novel and efficient algorithms for
matching XML query twig patterns in a parallel multi-threaded computing
platform. PPS and PTS are based on the PathStack and TwigStack
algorithms [1]. These algorithms employ a sophisticated search technique
for limiting processing to specific subtrees. We conducted extensive
experimentation with PPS and PTS. We compared PPS and PTS to the
standard (sequential) PathStack and TwigStack algorithms in terms of run
time (to completion). We checked their performance for varying numbers
of threads. Experimental results indicate that using PPS and PTS
significantly reduces the running time of queries in comparison with the
PathStack/TwigStack algorithm (up to 44 times faster for DBLP queries and
up to 22 times faster for XMark queries).](https://image.slidesharecdn.com/multi-coreprocessingofxmltwigpatterns-150622043357-lva1-app6892/85/Multi-core-processing-of-xml-twig-patterns-1-320.jpg)
Multi core processing of xml twig patterns
- 1. Multi-Core Processing of XML Twig Patterns Abstract: 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, which often may be abstracted by twig patterns. Finding all occurrences of such a twig pattern in an XML database is a basic operation for XML query processing. We present the parallel path stack algorithm (PPS) and the parallel twig stack algorithm (PTS). PPS and PTS are novel and efficient algorithms for matching XML query twig patterns in a parallel multi-threaded computing platform. PPS and PTS are based on the PathStack and TwigStack algorithms [1]. These algorithms employ a sophisticated search technique for limiting processing to specific subtrees. We conducted extensive experimentation with PPS and PTS. We compared PPS and PTS to the standard (sequential) PathStack and TwigStack algorithms in terms of run time (to completion). We checked their performance for varying numbers of threads. Experimental results indicate that using PPS and PTS significantly reduces the running time of queries in comparison with the PathStack/TwigStack algorithm (up to 44 times faster for DBLP queries and up to 22 times faster for XMark queries).
- 2. Existing System: The problem we address is how to speed up processing for twig queries, an important subset of the XPath language, within a multi-core architecture. Unlike prior work, we deal with parallelizing the execution of a single XPath query. The space of possible algorithms and associated storage structures, and indices, is enormous. Proposed System: In this paper we present the Parallel Path Stack algorithm (PPS) and the Parallel Twig Stack algorithm (PTS), novel parallel algorithms for processing a single twig pattern in an L-Stream environment. PPS and PTS are based on the PathStack and TwigStack algorithms. TwigStack is a basic algorithm for XML documents that utilizes the LStream representation. The PathStack and TwigStack algorithms are designed so that no large intermediate results are created. The reason we chose these particular algorithms is that they are very well understood and effective, and therefore can provide a good vehicle to demonstrate the power of parallelism in the context of XML querying. Hardware Requirements:
- 3. • System : Pentium IV 2.4 GHz. • Hard Disk : 40 GB. • Floppy Drive : 1.44 Mb. • Monitor : 15 VGA Colour. • Mouse : Logitech. • RAM : 256 Mb. Software Requirements: • Operating system : - Windows XP. • Front End : - JSP • Back End : - SQL Server Software Requirements: • Operating system : - Windows XP. • Front End : - .Net • Back End : - SQL Server