Datalog Queries Distributing over Components

DOI10.1145/3022743zbMath1367.68081OpenAlexW2593492066MaRDI QIDQ5278203

Tom J. Ameloot, Bas Ketsman, Frank Neven, Daniel Zinn

Publication date: 13 July 2017

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/4992/

zbMATH Keywords

well-founded semanticsDatalogdistributed databasesstratified semanticscoordination-free evaluation

Mathematics Subject Classification ID

Database theory (68P15) Logic programming (68N17)

Related Items (3)

A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries ⋮ Unnamed Item ⋮ Distribution policies for Datalog

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bottom-up evaluation and query optimization of well-founded models
• The alternating fixpoint of logic programs with negation
• The expressive power of stratified logic programs with value invention
• On Datalog vs. LFP
• Some useful preservation theorems
• Equivalence of Datalog queries is undecidable
• Relational transducers for declarative networking

This page was built for publication: Datalog Queries Distributing over Components