Corpus ID: 6826596

D edalus : Datalog in Time and Space

  title={D edalus : Datalog in Time and Space},
  author={Peter Alvaro and William R. Marczak and Neil Conway and Joseph M. Hellerstein and David Maier and Russell Sears},
Recent research has explored using Datalog-based languages to express a distributed system as a set of logical invariants [2, 19]. Two properties of distributed systems proved difficult to model in Datalog. First, the state of any such system evolves with its execution. Second, deductions in these systems may be arbitrarily delayed, dropped, or reordered by the unreliable network links they must traverse. Previous efforts addressed the former by extending Datalog to include updates, key… Expand

Figures from this paper


Enhancing the expressive power of the U-Datalog language
A semantics, based on stratification, handling the use of negated atoms in U-Datalog programs is provided, and which problems arise in defining a compositional semantics are shown. Expand
Operational Semantics for Declarative Networking
An operational semantics for Declarative Networking is proposed that addresses the presence of asynchronous communication, distribution, and imperative modification of the program state and keeps open a design space required at the current stage of the language development. Expand
Declarative networking: language, execution and optimization
This paper introduces and proves correct relaxed versions of the traditional semi-naïve query evaluation technique, and presents a number of query optimization opportunities that arise in the declarative networking context, including applications of traditional techniques as well as new optimizations. Expand
Data Structures Considered Harmful
We describe an approach to logic programming where the execution of a pure logic program is ordered on “temporal” values in the program. The resulting programs are relational and avoid a prematureExpand
DATALOG with Constraints: A Foundation for Trust Management Languages
The class of linearly decomposable unary constraint domains are defined, it is proved that DATALOG extended with constraints in any combination of such constraint domains is tractable, and it is shown that permissions associated with structured resources fall into this class. Expand
Timed Default Concurrent Constraint Programming
A complete treatment of hiding, along with a detailed treatment of the model, is presented, which shows that the model is expressive by defining combinators from the synchronous languages and supports the properties of multiform time, orthogonal pre-emption and executable specifications. Expand
I do declare: consensus in a logic language
It is found that the Paxos algorithm is easily translated to declarative logic, in large part because the primitives used in consensus protocol specifications map directly to simple Overlog constructs such as aggregation and selection. Expand
Dyna: a declarative language for implementing dynamic programs
The first version of a new declarative programming language, designed especially for rapid development of new statistical NLP systems, is presented, which intends for it to generalize and encapsulate best practices, and serve as a testbed for new practices. Expand
Context-sensitive program analysis as database queries
A new framework, based on the concept ofuctive databases, for context-sensitive program analysis, and a language called PQL that makes a subset of Datalogqueries more intuitive to define to make developing application-specific analyses easy for programmers. Expand
Greedy Algorithms in Datalog with Choice and Negation
The framework of Datalog-like languages is extended to obtain simple declarative formulations for such problems, and eeective implementation techniques are proposed to ensure computational complexities comparable to those of procedural formulations. Expand