Why a single parallelization strategy is not enough in knowledge bases

DOI10.1016/0022-0000(93)90019-SMaRDI QIDQ686639zbMATH OpenOpenAlexFDO

Authors Simona R. Cohen, Ouri Wolfson

Publication date 10 October 1993

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(93)90019-s

zbMATH Keywords

parallel computationPrologDatalog

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Decomposability and its role in parallel logic-program evaluation
• Parallel bottom-up processing of datalog queries
• A probabilistic view of Datalog parallelization
• The parallel complexity of single rule logic programs
• scientific article; zbMATH DE number 1862076

Cites work

• scientific article; zbMATH DE number 3945331 (Why is no real title available?)
• scientific article; zbMATH DE number 4049157 (Why is no real title available?)
• scientific article; zbMATH DE number 4064542 (Why is no real title available?)
• An observation on time-storage trade off
• Closures and fairness in the semantics of programming logic
• Parallel complexity of logical query programs

Cited in

(4)

• Distribution policies for Datalog
• Parallel bottom-up processing of datalog queries
• Decomposability and its role in parallel logic-program evaluation
• Parallel bottom-up evaluation of logic programs: \(\mathcal{D}e\mathcal{ALS}\) on shared-memory multicore machines

This page was built for publication: Why a single parallelization strategy is not enough in knowledge bases

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