Database Paper Browser

Back to papers

Weaker Forms of Monotonicity for Declarative Networking: a More Fine-grained Answer to the CALM-conjecture

Summary: Introduces a hierarchy of weaker monotonicity notions that exactly correspond to classes of coordination-free computations and provides explicit Datalog fragments (e.g., connected rules except in the final stratum) capturing each class. Characterizes coordination-freeness as absence of any need for global knowledge of other nodes, yielding a fine-grained refinement of the CALM conjecture. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1617
Venue
PODS
Year
2014
Pagerank
4.6426494e-05
Overall Rank
7,822 | 45.59%
DOI
10.1145/2594538.2594541

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Rank Citing Paper Year Venue Pagerank
5,705 Datalog Unchained 2021 PODS 5.3621239e-05
8,215 Parallel-Correctness and Transferability for Conjunctive Queries 2015 PODS 4.5577562e-05
11,159 Distributed Consistency Beyond Queries 2023 PODS 4.1945683e-05
11,315 Decoupled Transactions: Low Tail Latency Online Transactions Atop Jittery Servers 2022 CIDR 4.1945683e-05
11,831 Logical Aspects of Massively Parallel and Distributed Systems 2016 PODS 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 12 of 12 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers