A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation

DOI10.1017/S1471068419000358zbMath1434.68142arXiv1907.10278OpenAlexW2974902286WikidataQ127225805 ScholiaQ127225805MaRDI QIDQ5108522

Ariyam Das, Carlo Zaniolo

Publication date: 4 May 2020

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

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

zbMATH Keywords

parallel computingdistributed computingbulk-synchronous parallel modelDatalogdeductive databasesrecursive querystale-synchronous parallel model

Mathematics Subject Classification ID

Database theory (68P15) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Logic programming (68N17) Computational aspects of data analysis and big data (68T09)

Related Items

Parallel Logic Programming: A Sequel ⋮ A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation ⋮ Unnamed Item

Uses Software

• GraphLab
• Pregel
• BigDatalog

Cites Work

• Parallel bottom-up processing of datalog queries
• Scaling-up reasoning and advanced analytics on BigData
• A datalog-based computational model for coordination-free, data-parallel systems
• Fixpoint semantics and optimization of recursive Datalog programs with aggregates
• Parallel-Correctness and Transferability for Conjunctive Queries
• Weaker Forms of Monotonicity for Declarative Networking
• A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
• Relational transducers for declarative networking
• A declarative extension of horn clauses, and its significance for datalog and its applications