Distributed processing of logic programs

Authors:
Ouri Wolfson;Avi Silberschatz
Affiliations:
Computer Science Department, The Technion - Israel Institute of Technology, Haifa 32000, Israel;Computer Science Department, University of Texas at Austin, Austin, TX and NSF grant DCR-8507224 and ONR Contract N00014-86-K-0161
Venue:
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Year:
1988

Citing 11
Cited 19

Magic sets and other strange ways to implement logic programs (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Data independent recursion in deductive databases

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Parallel evaluation of recursive rule queries

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Logic programming and parallel complexity

Proceedings on International conference on database theory
An amateur's introduction to recursive query processing strategies

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Database theory—past and future

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The parallel complexity of simple chain queries

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the propagation of selection into logic programs

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A decidable class of bounded recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
One-sided recursions

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language

Journal of the ACM (JACM)

Sharing the load of logic-program evaluation

DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
On distributed processibility of datalog queries by decomposing databases

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Why a single parallelization strategy is not enough in knowledge bases

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A new paradigm for parallel and distributed rule-processing

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
A framework for the parallel processing of Datalog queries

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Deductive databases in action

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parallelizing Datalog programs by generalized pivoting

PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Incremental evaluation of rules and its relationship to parallelism

SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
A Parallel Scheme Using the Divide-and-Conquer Method

Distributed and Parallel Databases
Dynamically distributed query evaluation

PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Parallel execution of prolog programs: a survey

ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments

IEEE Transactions on Knowledge and Data Engineering
Data Partition and Parallel Evaluation of Datalog Programs

IEEE Transactions on Knowledge and Data Engineering
Mapping Datalog Program Execution to Networks of Processors

IEEE Transactions on Knowledge and Data Engineering
Parallel and Distributed Processing of Rules by Data-Reduction

IEEE Transactions on Knowledge and Data Engineering
Stack splitting: a technique for efficient exploitation of search parallelism on share-nothing platforms

Journal of Parallel and Distributed Computing
Experimenting with parallelism for the instantiation of ASP programs

Journal of Algorithms
A parallel ASP instantiator based on DLV

Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
A communication agreement framework for access/action control

SP'96 Proceedings of the 1996 IEEE conference on Security and privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is concerned with the issue of parallel evaluation of logic programs. To address this issue we define a new concept of predicate decomposability. If a predicate is decomposable, it means that the load of evaluating it can be divided among a number of processors, without a need for communication among them. This in turn results in a very significant speed-up of the evaluation process.We completely characterize three classes of single rule programs (sirups) with respect to decomposability nonrecursive, linear, and simple chain programs. All three classes were studied previously in various contexts. We establish that nonrecursive programs are decomposable, whereas for the other two classes we determine which ones are, and which ones are not decomposable. We also establish two sufficient conditions for sirup decomposability.