research-article

Datalog Queries Distributing over Components

Authors:

Tom J. Ameloot,

Daniel ZinnAuthors Info & Claims

ACM Transactions on Computational Logic (TOCL), Volume 18, Issue 1

Article No.: 5, Pages 1 - 35

https://doi.org/10.1145/3022743

Published: 22 February 2017 Publication History

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₂ (a particular class of coordination-free queries).

References

[1]

S. Abiteboul, Z. Abrams, S. Haar, and T. Milo. 2005. Diagnosis of asynchronous discrete event systems: Datalog to the rescue&excl; In PODS. ACM, 358--367.

Digital Library

[2]

S. Abiteboul, R. Hull, and V. Vianu. 1995. Foundations of Databases. Addison-Wesley.

Digital Library

[3]

P. Alvaro, N. Conway, J. M. Hellerstein, and D. Maier. 2014. Blazes: Coordination analysis for distributed programs. In Proceedings of the IEEE 30th International Conference on Data Engineering. IEEE, 52--63.

[4]

T. J. Ameloot, B. Ketsman, F. Neven, and D. Zinn. 2015. Datalog queries distributing over components. In Proceedings of the 18th International Conference on Database Theory. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 308--323.

[5]

T. J. Ameloot, B. Ketsman, F. Neven, and D. Zinn. 2016. Weaker forms of monotonicity for declarative networking: a More fine-grained answer to the CALM-conjecture. ACM Trans. Database Syst. 40, 4 (2016), 21.

Digital Library

[6]

T. J. Ameloot, F. Neven, and J. Van den Bussche. 2013. Relational transducers for declarative networking. J. ACM 60, 2 (2013), 15:1--15:38.

Digital Library

[7]

Gerald Berger and Andreas Pieris. 2016. Ontology-mediated queries distributing over components. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI'16). New York, NY, USA, 943--949.

Digital Library

[8]

L. Cabibbo. 1998. The expressive power of stratified logic programs with value invention. Inf. Comput. 147, 1 (1998), 22--56.

Digital Library

[9]

K. J. Compton. 1983. Some useful preservation theorems. J. Symbol. Logic 48 (1983), 427--440. Issue 2.

[10]

N. Conway, W. R. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier. 2012. Logic and lattices for distributed programming. In Proceedings of the 3rd ACM Symposium on Cloud Computing. ACM Press, 1:1--1:14.

Digital Library

[11]

A. Dawar and S. Kreutzer. 2008. On datalog vs. LFP. In Proceedings of the 35th International Colloquium on Automata, Languages and Programming. Springer, 160--171.

Digital Library

[12]

Guozhu Dong. 1989. On distributed processibility of datalog queries by decomposing databases. In Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data. Portland, Oregon, 26--35.

Digital Library

[13]

T. Feder and M. Y. Vardi. 2003. Homomorphism closed vs. existential positive. In LICS. IEEE Computer Society, 311--320.

Digital Library

[14]

I. Guessarian. 1990. Deciding boundedness for uniformly connected datalog programs. In ICDT (Lecture Notes in Computer Science), S. Abiteboul and P. C. Kanellakis (Eds.), Vol. 470. Springer, 395--405.

Digital Library

[15]

J. M. Hellerstein. 2010. The declarative imperative: Experiences and conjectures in distributed logic. SIGMOD Rec. 39, 1 (2010), 5--19.

Digital Library

[16]

R. Hull and M. Yoshikawa. 1990. ILOG: Declarative creation and manipulation of object identifiers. In VLDB. Morgan Kaufmann, 455--468.

Digital Library

[17]

T. Jim and D. Suciu. 2001. Dynamically distributed query evaluation. In PODS. ACM, 28--39.

Digital Library

[18]

D. B. Kemp, D. Srivastava, and P. J. Stuckey. 1995. Bottom-up evaluation and query optimization of well-founded models. Theor. Comput. Sci. 146, 182 (1995), 145--184.

Digital Library

[19]

B. T. Loo, T. Condie, M. Garofalakis, D. E. Gay, J. M. Hellerstein, P. Maniatis, R. Ramakrishnan, T. Roscoe, and I. Stoica. 2006. Declarative networking: Language, execution and optimization. In SIGMOD. ACM, 97--108.

Digital Library

[20]

O. Shmueli. 1993. Equivalence of datalog queries is undecidable. J. Logic Program. 15, 3 (1993), 231--241.

Digital Library

[21]

A. Van Gelder. 1993. The alternating fixpoint of logic programs with negation. J. Comput. Syst. Sci. 47, 1 (1993), 185--221.

Digital Library

[22]

D. Zinn, T. J. Green, and B. Ludäscher. 2012. Win-move is coordination-free (sometimes). In Proceedings of the 15th International Conference on Database Theory. ACM, 99--113.

Digital Library

Cited By

Karimi AYou J(2020)Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating DependenciesRules and Reasoning10.1007/978-3-030-57977-7_10(140-149)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-57977-7_10
Surinx DVan den Bussche J(2019)A monotone preservation result for Boolean queries expressed as a containment of conjunctive queriesInformation Processing Letters10.1016/j.ipl.2019.06.001150:C(1-5)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1016/j.ipl.2019.06.001

Index Terms

Datalog Queries Distributing over Components
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Parallel and distributed DBMSs
    2. Query languages
      1. Relational database query languages
2. Theory of computation
  1. Logic
    1. Finite Model Theory

Recommendations

Well-founded semantics for extended datalog and ontological reasoning
PODS '13: Proceedings of the 32nd ACM SIGMOD-SIGACT-SIGAI symposium on Principles of database systems

The Datalog± family of expressive extensions of Datalog has recently been introduced as a new paradigm for query answering over ontologies, which captures and extends several common description logics. It extends plain Datalog by features such as ...
On the complexity of single-rule datalog queries
Special issue: ICC '99

Datalog programs containing a unique rule and possibly some facts are known as single rule programs, or sirups. We study the complexity of evaluating sirups over variable and fixed databases, respectively, as well as the descriptive complexity of sirups,...
Abstract Hilbertian deductive systems, infon logic, and Datalog

In the first part of the paper, we discuss abstract Hilbertian deductive systems; these are systems defined by abstract notions of formula, axiom, and inference rule. We use these systems to develop a general method for converting derivability problems, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computational Logic

ACM Transactions on Computational Logic Volume 18, Issue 1

January 2017

277 pages

ISSN:1529-3785

EISSN:1557-945X

DOI:10.1145/3041822

Editor:
Orna Kupferman
School of Computer Science and Engineering, Hebrew University, Israel

Issue’s Table of Contents

Copyright © 2017 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 February 2017

Accepted: 01 December 2016

Revised: 01 October 2016

Received: 01 September 2015

Published in TOCL Volume 18, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
164
Total Downloads

Downloads (Last 12 months)13
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Karimi AYou J(2020)Distributed Reasoning for Restricted Weakly-Linear Disjunctive Tuple-Generating DependenciesRules and Reasoning10.1007/978-3-030-57977-7_10(140-149)Online publication date: 29-Jun-2020
https://dl.acm.org/doi/10.1007/978-3-030-57977-7_10
Surinx DVan den Bussche J(2019)A monotone preservation result for Boolean queries expressed as a containment of conjunctive queriesInformation Processing Letters10.1016/j.ipl.2019.06.001150:C(1-5)Online publication date: 1-Oct-2019
https://dl.acm.org/doi/10.1016/j.ipl.2019.06.001

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents