Fast Parallel Hypertree Decompositions in Logarithmic Recursion Depth release_oi4xlyxds5estgk6fcpsqjwcqi

by Georg Gottlob, Matthias Lanzinger, Cem Okulmus, Reinhard Pichler

Released as a article .

2022  

Abstract

Modern trends in data collection are bringing current mainstream techniques for database query processing to their limits. Consequently, various novel approaches for efficient query processing are being actively studied. One such approach is based on hypertree decompositions (HDs), which have been shown to carry great potential to process complex queries more efficiently and with stronger theoretical guarantees. However, using HDs for query execution relies on the difficult task of computing decompositions of the query structure, which guides the efficient execution of the query. From theoretical results we know that the performance of purely sequential methods is inherently limited, yet the problem is susceptible to parallelisation. In this paper we propose the first algorithm for computing hypertree decompositions that is well-suited for parallelisation. The proposed algorithm log-k-decomp requires only a logarithmic number of recursion levels and additionally allows for highly parallelised pruning of the search space by restriction to balanced separators. We provide detailed experimental evaluation over the HyperBench benchmark and demonstrate that our approach is highly effective especially for complex queries.
In text/plain format

Archived Files and Locations

application/pdf  942.8 kB
file_grmwogxnnjhxrmg2x44htr4us4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   accepted
Date   2022-04-12
Version   v2
Language   en ?
arXiv  2104.13793v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: ea3e7501-c8bf-40b5-b238-c1ac845523bc
API URL: JSON