A probabilistic view of Datalog parallelization
From MaRDI portal
Publication:1389447
DOI10.1016/S0304-3975(97)00091-1zbMATH Open0893.68051OpenAlexW2159340819MaRDI QIDQ1389447FDOQ1389447
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite-model theory -- A personal perspective
- Monadic generalized spectra
- Universal graphs and universal functions
- Relational queries computable in polynomial time
- Structure and complexity of relational queries
- Complexity of the first-order theory of almost all finite structures
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
- Title not available (Why is that?)
- Distribution policies for Datalog
- Distribution policies for Datalog
- Scaling-up reasoning and advanced analytics on BigData
Uses Software
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)
