Dissertation/Thesis Abstract

A study of a data parallel algorithm for XML DOM parsing
by Shah, Bhavik Bharatkumar, M.S., University of Missouri - Kansas City, 2009, 50; 1478718
Abstract (Summary)

XML parsing is a core operation performed on an XML document and can cause performance bottlenecks in applications and system processing large volumes of XML data. Parallelism is a natural way to boost the parsing performance. Leveraging multicore processors can offer a cost-effective solution. We study a data parallel algorithm called ParDOM for XML DOM parsing that builds an in-memory tree structure for an XML document. ParDOM has two phases In the first phase, an XML document is partitioned and parsed in parallel. In the second phase, the partial DOM node tree structures, are linked together (in parallel) to build a complete DOM node tree. ParDOM offers fine-grained parallelism by adopting a flexible chunking scheme and it can be conveniently implemented using a data parallel programming model that supports map and sort operations. We show that ParDOM yields better scalability than PXP [24] – a recently proposed parallel DOM parsing algorithm.

Indexing (document details)
Advisor: Rao, Praveen
School: University of Missouri - Kansas City
School Location: United States -- Missouri
Source: MAI 48/04M, Masters Abstracts International
Subjects: Computer Engineering, Electrical engineering, Computer science
Publication Number: 1478718
ISBN: 9781109619690
Copyright © 2019 ProQuest LLC. All rights reserved. Terms and Conditions Privacy Policy Cookie Policy