logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

PARALLEL AND DISTRIBUTED-PROCESSING OF RULES BY DATA-REDUCTION

delete1993-06-01
delete9
PRE
AI
O
Ouri Wolfson
DOI：10.1109/69.224203delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
The paper is concerned with the parallel evaluation of datalog rule programs, mainly by processors that are interconnected by a communication network. A paradigm, called data-reduction, for the parallel evaluation of a datalog program, is introduced. Parallelization is by partitioning the rule-instantiations among the processors. After presenting the paradigm, its implementation with seminaive evaluation, its communication overhead, and its application to stratified-negation datalog programs are discussed. It is proven that decomposability, a related concept introduced in previous works, is undecidable.
Keywords:
COMMUNICATION
DATA REDUCTION
DATABASES
DATALOG
DISTRIBUTED COMPUTING
PARALLEL COMPUTING
LOGIC PROGRAMMING
RULES
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Knowledge and Data Engineering cover
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
Papers:
6.8K
Citations:
3.2W

Organization

No organization information available