Parsing XML using parallel traversal of streaming trees

5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

XML has been widely adopted across a wide spectrum of applications. Its parsing efficiency, however, remains a concern, and can be a bottleneck. With the current trend towards multicore CPUs, parallelization to improve performance is increasingly relevant. In many applications, the XML is streamed from the network, and thus the complete XML document is never in memory at any single moment in time. Parallel parsing of such a stream can be equated to parallel depth-first traversal of a streaming tree. Existing research on parallel tree traversal has assumed the entire tree was available in-memory, and thus cannot be directly applied. In this paper we investigate parallel, SAX-style parsing of XML via a parallel, depth-first traversal of the streaming document. We show good scalability up to about 6 cores on a Linux platform. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Pan, Y., Zhang, Y., & Chiu, K. (2008). Parsing XML using parallel traversal of streaming trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5374 LNCS, pp. 142–156). Springer Verlag. https://doi.org/10.1007/978-3-540-89894-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free