PAXQuery: Efficient Parallel Processing of Complex XQuery

Jesús Camacho-Rodríguez; Dario Colazzo; Ioana Manolescu

doi:10.1109/TKDE.2015.2391110

PAXQuery: Efficient Parallel Processing of Complex XQuery

Jesús Camacho-Rodríguez
, Dario Colazzo
, Ioana Manolescu

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Article number	7006747
Pages (from-to)	1977-1991
Number of pages	15
Journal	IEEE Transactions on Knowledge and Data Engineering
Volume	27
Issue number	7
DOIs	https://doi.org/10.1109/TKDE.2015.2391110
Publication status	Published - 1 Jul 2015
Externally published	Yes

Keywords

XML data management
XQuery parallelization
XQuery processing

Access to Document

10.1109/TKDE.2015.2391110

Cite this

@article{2aeabbc445d84239b4614cc3446f2554,

title = "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.",

keywords = "XML data management, XQuery parallelization, XQuery processing",

author = "Jes{\'u}s Camacho-Rodr{\'i}guez and Dario Colazzo and Ioana Manolescu",

note = "Publisher Copyright: {\textcopyright} 2015 IEEE.",

year = "2015",

month = jul,

day = "1",

doi = "10.1109/TKDE.2015.2391110",

language = "English",

volume = "27",

pages = "1977--1991",

journal = "IEEE Transactions on Knowledge and Data Engineering",

issn = "1041-4347",

number = "7",

}

TY - JOUR

T1 - PAXQuery

T2 - Efficient Parallel Processing of Complex XQuery

AU - Camacho-Rodríguez, Jesús

AU - Colazzo, Dario

AU - Manolescu, Ioana

PY - 2015/7/1

Y1 - 2015/7/1

N2 - 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.

AB - 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.

KW - XML data management

KW - XQuery parallelization

KW - XQuery processing

U2 - 10.1109/TKDE.2015.2391110

DO - 10.1109/TKDE.2015.2391110

M3 - Article

AN - SCOPUS:84959500810

SN - 1041-4347

VL - 27

SP - 1977

EP - 1991

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

IS - 7

M1 - 7006747

ER -

PAXQuery: Efficient Parallel Processing of Complex XQuery

Abstract

Keywords

Access to Document

Fingerprint

Cite this