A probabilistic view of Datalog parallelization

DOI10.1016/S0304-3975(97)00091-1MaRDI QIDQ1389447zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Parallel bottom-up processing of datalog queries
• Why a single parallelization strategy is not enough in knowledge bases
• Distribution policies for Datalog
• Distribution policies for Datalog

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 839556 (Why is no real title available?)
• Complexity of the first-order theory of almost all finite structures
• Finite-model theory -- A personal perspective
• Monadic generalized spectra
• Relational queries computable in polynomial time
• Structure and complexity of relational queries
• Universal graphs and universal functions

Cited in

(8)

• Why a single parallelization strategy is not enough in knowledge bases
• Inherent complexity of recursive queries
• Parallel bottom-up processing of datalog queries
• A datalog-based computational model for coordination-free, data-parallel systems
• scientific article; zbMATH DE number 7561474 (Why is no real title available?)
• Distribution policies for Datalog
• Distribution policies for Datalog
• Scaling-up reasoning and advanced analytics on BigData

Describes a project that uses

Uses Software

• Datalog

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

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