Document Server@UHasselt >
Research >
Research publications >

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

Title: Datalog Queries Distributing over Components
Authors: Ameloot, Tom J.
Ketsman, Bas
Neven, Frank
Zinn, Daniel
Issue Date: 2017
Citation: ACM Transactions on Computational Logic, 18(1), p. 1-35 (Art N° 5)
Abstract: We investigate the class D of queries that distribute over components. These are the queries that can be evaluated by taking the union of the query results over the connected components of the database instance. We show that it is undecidable whether a (positive) Datalog program distributes over components. Additionally, we show that connected Datalog¬ (the fragment of Datalog¬ where all rules are connected) provides an effective syntax for Datalog¬ programs that distribute over components under the stratified as well as under the well-founded semantics. As a corollary, we obtain a simple proof for one of the main results in previous work [Zinn et al. 2012], namely that the classic win-move query is in F2 (a particular class of coordination-free queries).
URI: http://hdl.handle.net/1942/24952
DOI: 10.1145/3022743
ISI #: 000399803800005
ISSN: 1529-3785
Category: A1
Type: Journal Contribution
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
Published version1.01 MBAdobe PDF

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