A datalog-based computational model for coordination-free, data-parallel systems

DOI10.1017/S147106841800042XzbMath1452.68078arXiv1405.7264OpenAlexW2962820040MaRDI QIDQ4559834

Matteo Interlandi, Letizia Tanca

Publication date: 4 December 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.7264

zbMATH Keywords

Datalogrelational transducerdeclarative networkingbulk synchronous parallel systemsCALM conjecture

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17)

Related Items (1)

A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation

Uses Software

• MapReduce
• Giraph
• Datalog
• Hive
• DIADEM
• Dynamo

Cites Work

• Monotonic aggregation in deductive databases
• Relational transducers for electronic commerce
• On datalog vs polynomial time
• How expressive is stratified aggregation?
• On interactive knowledge with bounded communication
• Undecidable optimization problems for database logic programs
• Beyond Lamport's Happened-before
• Beyond Lamport’s Happened-Before: On the Role of Time Bounds in Synchronous Systems
• Time, clocks, and the ordering of events in a distributed system
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Relational transducers for declarative networking
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A datalog-based computational model for coordination-free, data-parallel systems