A probabilistic view of Datalog parallelization

DOI10.1016/S0304-3975(97)00091-1zbMath0893.68051OpenAlexW2159340819MaRDI QIDQ1389447

Sérgio Lifschitz, Victor Vianu

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00091-1

zbMATH Keywords

Datalog programsDatalog parallelization strategiesrandomly generated data

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (2)

Scaling-up reasoning and advanced analytics on BigData ⋮ Inherent complexity of recursive queries

Uses Software

• Datalog

Cites Work

• Finite-model theory -- A personal perspective
• Structure and complexity of relational queries
• Complexity of the first-order theory of almost all finite structures
• Relational queries computable in polynomial time
• Monadic generalized spectra
• Universal graphs and universal functions
• Unnamed Item
• Unnamed Item

This page was built for publication: A probabilistic view of Datalog parallelization