research-article

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture

Authors:

Tom J. Ameloot,

Daniel ZinnAuthors Info & Claims

ACM Transactions on Database Systems (TODS), Volume 40, Issue 4

Article No.: 21, Pages 1 - 45

https://doi.org/10.1145/2809784

Published: 22 December 2015 Publication History

Abstract

The CALM-conjecture, first stated by Hellerstein [2010] and proved in its revised form by Ameloot et al. [2013] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the query is monotone. Zinn et al. [2012] extended the framework of relational transducer networks to allow for specific data distribution strategies and showed that the nonmonotone win-move query is coordination-free for domain-guided data distributions. In this article, we extend the story by equating increasingly larger classes of coordination-free computations with increasingly weaker forms of monotonicity and present explicit Datalog variants that capture each of these classes. One such fragment is based on stratified Datalog where rules are required to be connected with the exception of the last stratum. In addition, we characterize coordination-freeness as those computations that do not require knowledge about all other nodes in the network, and therefore, can not globally coordinate. The results in this article can be interpreted as a more fine-grained answer to the CALM-conjecture.

References

[1]

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

Digital Library

[2]

S. Abiteboul, O. Benjelloun, and T. Milo. 2008. The active XML project: An overview. VLDB J. 17, 5, 1019--1040.

Digital Library

[3]

S. Abiteboul, M. Bienvenu, A. Galland, and E. Antoine. 2011. A rule-based language for Web data management. In Proceedings of PODS. ACM, 293--304.

Digital Library

[4]

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

Digital Library

[5]

S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. 1998. Relational transducers for electronic commerce. In Proceedings of PODS. ACM, 179--187.

Digital Library

[6]

S. Abiteboul, V. Vianu, B. Fordham, and Y. Yesha. 2000. Relational transducers for electronic commerce. J. Comput. Syst. Sci. 61, 2, 236--269.

Digital Library

[7]

F. Afrati, S. S. Cosmadakis, and M. Yannakakis. 1995. On Datalog vs polynomial time. J. Comput. Syst. Sci. 51, 177--196.

Digital Library

[8]

F. N. Afrati, V. R. Borkar, M. J. Carey, N. Polyzotis, and J. D. Ullman. 2011. Map-reduce extensions and recursive queries. In Proceedings of ICDE. 1--8.

Digital Library

[9]

F. N. Afrati, P. Koutris, D. Suciu, and J. D. Ullman. 2012. Parallel skyline queries. In Proceedings of ICDT. 274--284.

Digital Library

[10]

F. N. Afrati and J. D. Ullman. 2010. Optimizing joins in a map-reduce environment. In Proceedings of EDBT. 99--110.

Digital Library

[11]

F. N. Afrati and J. D. Ullman. 2012. Transitive closure and recursive Datalog implemented on clusters. In Proceedings of EDBT. 132--143.

Digital Library

[12]

P. Alvaro, N. Conway, J. Hellerstein, and W. R. Marczak. 2011. Consistency analysis in bloom: A CALM and collected approach. In Proceedings of CIDR. 249--260.

[13]

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

[14]

P. Alvaro, W. Marczak, N. Conway, J. M. Hellerstein, D. Maier, and R. C. Sears. 2009. Dedalus: Datalog in time and space. Tech. Rep. UCB/EECS-2009-173. EECS Department, University of California, Berkeley.

[15]

T. J. Ameloot. 2014. Deciding correctness with fairness for simple transducer networks. In Proceedings of ICDT.

[16]

T. J. Ameloot, B. Ketsman, F. Neven, and D. Zinn. 2014. Weaker forms of monotonicity for declarative networking: A more fine-grained answer to the calm-conjecture. In Proceedings of PODS. ACM, 64--75.

Digital Library

[17]

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 (ICDT). 308--323.

[18]

T. J. Ameloot, F. Neven, and J. Van den Bussche. 2013. Relational transducers for declarative networking. J. ACM 60, 2, 15.

Digital Library

[19]

T. J. Ameloot and J. Van den Bussche. 2012a. Deciding eventual consistency for a simple class of relational transducer networks. In Proceedings of ICDT. 86--98.

Digital Library

[20]

T. J. Ameloot and J. Van den Bussche. 2012b. On the CRON conjecture. In Proceedings of Datalog. 44--55.

Digital Library

[21]

A. Atserias, A. Dawar, and M. Grohe. 2008. Preservation under extensions on well-behaved finite structures. SIAM J. Comput. 38, 4, 1364--1381.

Digital Library

[22]

P. Beame, P. Koutris, and D. Suciu. 2013. Communication steps for parallel query processing. In Proceedings of PODS. 273--284.

Digital Library

[23]

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

Digital Library

[24]

K. J. Compton. 1983. Some useful preservation theorems. J. Symb. Logic 48, 2, 427--440.

[25]

N. Conway, W. R. Marczak, P. Alvaro, J. M. Hellerstein, and D. Maier. 2012. Logic and lattices for distributed programming. In Proceedings of the Symposium on Cloud Computing (SoCC). ACM, 1.

Digital Library

[26]

A. Dawar and S. Kreutzer. 2008. On datalog vs. LFP. In Proceedings of ICALP. 160--171.

Digital Library

[27]

A. Deutsch, L. Sui, and V. Vianu. 2007. Specification and verification of data-driven Web applications. J. Comput. Syst. Sci. 73, 3, 442--474.

Digital Library

[28]

A. Deutsch, L. Sui, V. Vianu, and D. Zhou. 2006. Verification of communicating data-driven Web services. In Proceedings of PODS. ACM, 90--99.

Digital Library

[29]

T. Feder and M. Y. Vardi. 2003. Homomorphism closed vs. existential positive. In Proceedings of LICS. 311--320.

Digital Library

[30]

S. Grumbach and F. Wang. 2010. Netlog, a rule-based language for distributed programming. In Proceedings of the 12th International Conference on Practical Aspects of Declarative Languages. Springer-Verlag, 88--103.

Digital Library

[31]

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

Digital Library

[32]

R. Hull and J. Su. 1993. Algebraic and calculus query languages for recursively typed complex objects. J. Comput. Syst. Sci. 47, 1, 121--156.

Digital Library

[33]

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

Digital Library

[34]

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

Digital Library

[35]

B. Ketsman and F. Neven. 2015. Optimal broadcasting strategies for conjunctive queries over distributed data. In Proceedings of the 18th International Conference on Database Theory (ICDT). 291--307.

[36]

P. G. Kolaitis and M. Y. Vardi. 1990. On the expressive power of datalog: Tools and a case study. In Proceedings of PODS. 61--71.

Digital Library

[37]

P. Koutris and D. Suciu. 2011. Parallel evaluation of conjunctive queries. In Proceedings of PODS. 223--234.

Digital Library

[38]

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 Proceedings of the ACM SIGMOD International Conference on Management of Data. ACM, 97--108.

Digital Library

[39]

E. Rosen. 1995. Finite model theory and finite variable logics. Ph.D. Dissertation. University of Pennsylvania.

Digital Library

[40]

O. Shmueli. 1993. Equivalence of Datalog queries is undecidable. J. Logic Prog. 15, 3, 231--241.

Digital Library

[41]

W. W. Tait. 1959. A counterexample to a conjecture of Scott and Suppes. J. Symb. Logic 24, 1, 15--16.

[42]

D. Zinn. 2012. Weak forms of monotonicity and coordination-freeness. CoRR abs/1202.0242.

[43]

D. Zinn, T. J. Green, and B. Ludäscher. 2012. Win-move is coordination-free (sometimes). In Proceedings of ICDT. 99--113.

Digital Library

Cited By

Baccaert TKetsman BGeerts FNgo HSintos S(2023)Distributed Consistency Beyond QueriesProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588657(47-58)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588657
Vianu VLibkin LPichler RGuagliardo P(2021)Datalog UnchainedProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458815(57-69)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458815
Hellerstein JAlvaro P(2020)Keeping CALMCommunications of the ACM10.1145/336973663:9(72-81)Online publication date: 21-Aug-2020
https://dl.acm.org/doi/10.1145/3369736
Show More Cited By

Index Terms

Weaker Forms of Monotonicity for Declarative Networking: A More Fine-Grained Answer to the CALM-Conjecture
1. Information systems
  1. Data management systems
    1. Database management system engines
      1. Parallel and distributed DBMSs
    2. Query languages
2. Theory of computation

Recommendations

Weaker forms of monotonicity for declarative networking: a more fine-grained answer to the calm-conjecture
PODS '14: Proceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems

The CALM-conjecture, first stated by Hellerstein [23] and proved in its revised form by Ameloot et al. [13] within the framework of relational transducer networks, asserts that a query has a coordination-free execution strategy if and only if the query ...
Relational transducers for declarative networking

Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for “eventually consistent” distributed querying, based on relational transducers. A tight link has been conjectured between ...
Deciding eventual consistency for a simple class of relational transducer networks
ICDT '12: Proceedings of the 15th International Conference on Database Theory

Networks of relational transducers can serve as a formal model for declarative networking, focusing on distributed database querying applications. In declarative networking, a crucial property is eventual consistency, meaning that the final output does ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Database Systems

ACM Transactions on Database Systems Volume 40, Issue 4

Special Issue: Invited 2014 PODS and EDBT Revised Articles

February 2016

248 pages

ISSN:0362-5915

EISSN:1557-4644

DOI:10.1145/2866579

Editor:
Christian S. Jensen
Aalborg University, Denmark

Issue’s Table of Contents

Copyright © 2015 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 December 2015

Accepted: 01 July 2015

Revised: 01 July 2015

Received: 01 January 2015

Published in TODS Volume 40, Issue 4

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

10
Total Citations
View Citations
406
Total Downloads

Downloads (Last 12 months)58
Downloads (Last 6 weeks)8

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Baccaert TKetsman BGeerts FNgo HSintos S(2023)Distributed Consistency Beyond QueriesProceedings of the 42nd ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3584372.3588657(47-58)Online publication date: 18-Jun-2023
https://dl.acm.org/doi/10.1145/3584372.3588657
Vianu VLibkin LPichler RGuagliardo P(2021)Datalog UnchainedProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458815(57-69)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458815
Hellerstein JAlvaro P(2020)Keeping CALMCommunications of the ACM10.1145/336973663:9(72-81)Online publication date: 21-Aug-2020
https://dl.acm.org/doi/10.1145/3369736
DAS AZANIOLO C(2019)A Case for Stale Synchronous Distributed Model for Declarative Recursive ComputationTheory and Practice of Logic Programming10.1017/S147106841900035819:5-6(1056-1072)Online publication date: 20-Sep-2019
https://doi.org/10.1017/S1471068419000358
Surinx DVan den Bussche JVan Gucht D(2019)A framework for comparing query languages in their ability to express boolean queriesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-019-09639-5Online publication date: 8-Jun-2019
https://doi.org/10.1007/s10472-019-09639-5
Surinx DVan den Bussche JVan Gucht D(2018)A Framework for Comparing Query Languages in Their Ability to Express Boolean QueriesFoundations of Information and Knowledge Systems10.1007/978-3-319-90050-6_20(360-378)Online publication date: 18-Apr-2018
https://doi.org/10.1007/978-3-319-90050-6_20
Surinx DVan den Bussche JVan Gucht DAceto LIngólfsdóttir A(2017)The primitivity of operators in the algebra of binary relations under conjunctions of containmentsProceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science10.5555/3329995.3330057(1-10)Online publication date: 20-Jun-2017
https://dl.acm.org/doi/10.5555/3329995.3330057
Ameloot TKetsman BNeven FZinn D(2017)Datalog Queries Distributing over ComponentsACM Transactions on Computational Logic10.1145/302274318:1(1-35)Online publication date: 22-Feb-2017
https://dl.acm.org/doi/10.1145/3022743
Surinx DVan den Bussche JVan Gucht D(2017)The primitivity of operators in the algebra of binary relations under conjunctions of containments2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)10.1109/LICS.2017.8005122(1-10)Online publication date: Jun-2017
https://doi.org/10.1109/LICS.2017.8005122
Neven FMilo TTan W(2016)Logical Aspects of Massively Parallel and Distributed SystemsProceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/2902251.2902307(303-314)Online publication date: 15-Jun-2016
https://dl.acm.org/doi/10.1145/2902251.2902307

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