Demythization of Structural XML Query Processing: Comparison of Holistic and Binary Approaches
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F21%3A10247369" target="_blank" >RIV/61989100:27240/21:10247369 - isvavai.cz</a>
Alternative codes found
RIV/61989100:27730/21:10247369
Result on the web
<a href="https://ieeexplore.ieee.org/document/8862877" target="_blank" >https://ieeexplore.ieee.org/document/8862877</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/TKDE.2019.2946157" target="_blank" >10.1109/TKDE.2019.2946157</a>
Alternative languages
Result language
angličtina
Original language name
Demythization of Structural XML Query Processing: Comparison of Holistic and Binary Approaches
Original language description
XML queries can be modeled by twig pattern queries (TPQs) specifying predicates on XML nodes and XPath relationships satisfied between them. A lot of TPQ types have been proposed; this paper takes into account a TPQ model extended by a specification of output and non-output query nodes since it complies with the XQuery semantics and, in many cases, it leads to a more efficient query processing. In general, there are two types of approaches to process a TPQ: holistic joins and binary joins. Whereas the binary join approach builds a query plan as a tree of interconnected binary operators, the holistic join approach evaluates a whole query using one operator (i.e., using one complex algorithm). Surprisingly, a thorough analytical and experimental comparison is still missing despite an enormous research effort in this area. In this paper, we try to fill this gap; we analytically and experimentally show that the binary joins used in a fully-pipelined plan (i.e., the plan where each join operation does not wait for the complete result of the previous operation and no explicit sorting is used) can often outperform the holistic joins, especially for TPQs with a higher ratio of non-output query nodes. The main contributions of this paper can be summarized as follows: (i) we introduce several improvements of existing binary join approaches allowing to build a fully-pipelined plan for a TPQ considering non-output query nodes, (ii) we prove that for a certain class of TPQs such a plan has the linear time complexity with respect to the size of the input and output as well as the linear space complexity with respect to the XML document depth (i.e., the same complexity as the holistic join approaches), (iii) we show that our improved binary join approach outperforms the holistic join approaches in many situations, and (iv) we propose a simple combined approach that utilizes advantages of both types of approaches.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10200 - Computer and information sciences
Result continuities
Project
<a href="/en/project/LO1404" target="_blank" >LO1404: Sustainable Development of Center ENET</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Transactions on Knowledge and Data Engineering
ISSN
1041-4347
e-ISSN
—
Volume of the periodical
33
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
14
Pages from-to
1439-1452
UT code for WoS article
000626617900008
EID of the result in the Scopus database
2-s2.0-85102305093