Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/28162
Title: | Distribution Policies for Datalog | Authors: | KETSMAN, Bas Albarghouthi, Aws Koutris, Paraschos |
Issue Date: | 2018 | Publisher: | Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik | Source: | Kimelfeld, Benny; Amsterdamer, Yael (Ed.). 21st International Conference on Database Theory (ICDT 2018), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, (Art N° 17) | Series/Report: | Leibniz International Proceedings in Informatics (LIPIcs) | Series/Report no.: | 98 | Abstract: | Modern data management systems extensively use parallelism to speed up query processing over massive volumes of data. This trend has inspired a rich line of research on how to formally reason about the parallel complexity of join computation. In this paper, we go beyond joins and study the parallel evaluation of recursive queries. We introduce a novel framework to reason about multi-round evaluation of Datalog programs, which combines implicit predicate restriction with distribution policies to allow expressing a combination of data-parallel and query-parallel evaluation strategies. Using our framework, we reason about key properties of distributed Datalog evaluation, including parallel-correctness of the evaluation strategy, disjointness of the computation effort, and bounds on the number of communication rounds. | Keywords: | Datalog queries; Distributed evaluation; Distribution policies | Document URI: | http://hdl.handle.net/1942/28162 | Link to publication/dataset: | http://drops.dagstuhl.de/opus/volltexte/2018/8603/ | ISBN: | 9783959770637 | DOI: | 10.4230/LIPIcs.ICDT.2018.17 | Rights: | © Bas Ketsman, Aws Albarghouthi, and Paraschos Koutris; licensed under Creative Commons License CC-BY | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LIPIcs-ICDT-2018-17.pdf | Published version | 652.27 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.