Parallel bottom-up processing of datalog queries
From MaRDI portal
Recommendations
- A probabilistic view of Datalog parallelization
- The parallel complexity of single rule logic programs
- Why a single parallelization strategy is not enough in knowledge bases
- Parallel bottom-up evaluation of logic programs: \(\mathcal{D}e\mathcal{ALS}\) on shared-memory multicore machines
- Parallel complexity of logical query programs
Cited in
(21)- Why a single parallelization strategy is not enough in knowledge bases
- Parallel processing for the full reduction of a chain query in distributed databases
- Optimal broadcasting strategies for conjunctive queries over distributed data
- Top-down query processing in first-order deductive databases under the DWFS
- Modern Datalog Engines
- Ordered structures for parallel rule-based computations
- Parallel Logic Programming: A Sequel
- Parallel complexity of logical query programs
- Modular materialisation of Datalog programs
- Locality-aware distribution schemes
- A datalog-based computational model for coordination-free, data-parallel systems
- A Case for Stale Synchronous Distributed Model for Declarative Recursive Computation
- scientific article; zbMATH DE number 7561474 (Why is no real title available?)
- Efficient bottom-up computation of queries on stratified databases
- Distribution policies for Datalog
- Distribution policies for Datalog
- Parallel bottom-up evaluation of logic programs: \(\mathcal{D}e\mathcal{ALS}\) on shared-memory multicore machines
- scientific article; zbMATH DE number 1696727 (Why is no real title available?)
- Scaling-up reasoning and advanced analytics on BigData
- Parallelism in logic programs
- Preprocessing predicates and queries
This page was built for publication: Parallel bottom-up processing of datalog queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4015953)
