PAXQuery: Efficient Parallel Processing of Complex XQuery - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

PAXQuery: Efficient Parallel Processing of Complex XQuery

Abstract

Increasing volumes of data are being produced and exchanged over the Web, in particular in tree-structured formats such as XML or JSON. This leads to a need of highly scalable algorithms and tools for processing such data, capable to take advantage of massively parallel processing platforms.This work considers the problem of efficiently parallelizing the execution of complex nested data processing, expressed in XQuery. We provide novel algorithms showing how to translate such queries into PACT, a recent framework generalizing MapReduce in particular by supporting many-input tasks. We present the first formal translation of complex XQuery algebraic expressions into PACT plans, and demonstrate experimentally the efficiency and scalability of our approach.
Fichier principal
Vignette du fichier
paxquery-bda-2014.pdf (797.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01086809 , version 1 (25-11-2014)

Identifiers

  • HAL Id : hal-01086809 , version 1

Cite

Jesús Camacho-Rodríguez, Dario Colazzo, Ioana Manolescu. PAXQuery: Efficient Parallel Processing of Complex XQuery. BDA'2014: 30e journées Bases de Données Avancées, Oct 2014, Grenoble-Autrans, France. ⟨hal-01086809⟩
192 View
391 Download

Share

Gmail Facebook X LinkedIn More