Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/19797

Title: Parallel-Correctness and Transferability for Conjunctive Queries
Authors: Ameloot, Tom
Geck, Gaetano
Ketsman, Bas
Neven, Frank
Schwentick, Thomas
Issue Date: 2015
Publisher: ACM
Citation: Milo, Tova; Calvanese, Diego (Ed.). Proceedings of the 34th ACM Symposium on Principles of Database Systems, p. 47-58
Abstract: A dominant cost for query evaluation in modern massively distributed systems is the number of communication rounds. For this reason, there is a growing interest in single-round multiway join algorithms where data is first reshuffled over many servers and then evaluated in a parallel but communic- ation-free way. The reshuffling itself is specified as a distri- bution policy. We introduce a correctness condition, called parallel-correctness, for the evaluation of queries w.r.t. a distribution policy. We study the complexity of parallel- correctness for conjunctive queries as well as transferability of parallel-correctness between queries. We also investigate the complexity of transferability for certain families of distribution policies, including, for instance, the Hypercube distribution.
URI: http://hdl.handle.net/1942/19797
DOI: 10.1145/2745754.2745759
ISBN: 978-1-4503-2757-2
Category: C1
Type: Proceedings Paper
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A374.07 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.