Affiliation:
1. Hasselt University 8 transnational University of Limburg
2. LogicBlox, Inc.
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
F
2
(a particular class of coordination-free queries).
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Reference22 articles.
1. S. Abiteboul Z. Abrams S. Haar and T. Milo. 2005. Diagnosis of asynchronous discrete event systems: Datalog to the rescue! In PODS. ACM 358--367. 10.1145/1065167.1065214 S. Abiteboul Z. Abrams S. Haar and T. Milo. 2005. Diagnosis of asynchronous discrete event systems: Datalog to the rescue! In PODS. ACM 358--367. 10.1145/1065167.1065214
2. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley. S. Abiteboul R. Hull and V. Vianu. 1995. Foundations of Databases. Addison-Wesley.
3. Blazes: Coordination analysis for distributed programs
4. Weaker Forms of Monotonicity for Declarative Networking
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献