Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Datalog Queries Distributing over Components

Datalog Queries Distributing over Components 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). http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Loading next page...
 
/lp/association-for-computing-machinery/datalog-queries-distributing-over-components-KdTXy0VQvR

References (28)

Publisher
Association for Computing Machinery
Copyright
Copyright © 2017 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3022743
Publisher site
See Article on Publisher Site

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).

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Feb 22, 2017

Keywords: Datalog

There are no references for this article.