Datalog queries distributing over components

DOI10.1145/3022743MaRDI QIDQ5278203zbMATH OpenOpenAlexFDO

Authors 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

Datalogwell-founded semanticsdistributed databasesstratified semanticscoordination-free evaluation

Mathematics Subject Classification ID

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

Recommendations

• Datalog queries distributing over components
• On the expressive power of Datalog: tools and a case study.
• Linearisability on Datalog programs
• Distributed reasoning for restricted weakly-linear disjunctive tuple-generating dependencies
• Datalog extensions for database queries and updates

Cites work

• scientific article; zbMATH DE number 219219 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Bottom-up evaluation and query optimization of well-founded models
• Datalog queries distributing over components
• Equivalence of Datalog queries is undecidable
• On Datalog vs. LFP
• Relational transducers for declarative networking
• Some useful preservation theorems
• The alternating fixpoint of logic programs with negation
• The expressive power of stratified logic programs with value invention

Cited in

(5)

• scientific article; zbMATH DE number 7561479 (Why is no real title available?)
• A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
• Datalog and recursive query processing
• Distribution policies for Datalog
• Datalog queries distributing over components

This page was built for publication: Datalog queries distributing over components

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5278203)