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
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD 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
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Concurrent prolog: collected papers
Concurrent prolog: collected papers
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Data models and languages for databases
Lecture notes in computer science on ICDT '88
Performance evaluation of data intensive logic programs
Foundations of deductive databases and logic programming
Sharing the load of logic-program evaluation
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Effect of skew on join performance in parallel architectures
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
On distributed processibility of datalog queries by decomposing databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
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
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
Evaluating Recursive Queries in Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
Parallel and Distributed Processing of Rules by Data-Reduction
IEEE Transactions on Knowledge and Data Engineering
| Hi-index | 0.00 |
We argue that the appropriate parallelization strategy for logic-program evaluation depends on the program being evaluated. Therefore, this paper is concerned with the issues of program-classification, and parallelization-strategies. We propose five parallelization strategies that differ based on the following criteria. Their evaluation cost, the overhead of communication and synchronization among processors, and the programs to which they are applicable. In particular, we start our study with pure-parallelization, i.e., parallelization without overhead. An interesting class-structure of logic programs is demonstrated, when considering amenability to pure-parallelization. The relationship to the NC complexity class is discussed. Then we propose strategies that do incur an overhead, but are optimal in a sense that will be precisely defined.This paper makes the initial steps towards a theory of parallel logic-programming.