Naive evaluation of recursively defined relations
On knowledge base management systems: integrating artificial intelligence and d atabase technologies
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
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
Parallel logic programming in PARLOG: the language and its implementation
Parallel logic programming in PARLOG: the language and its implementation
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
Worst-case complexity analysis of methods for logic query implementation
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors
Proceedings of the Second Conference on Hypercube Multiprocessors on Hypercube multiprocessors
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
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
Parallel processing of recursive queries in distributed architectures
VLDB '89 Proceedings of the 15th international conference on Very large data bases
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
Parallelism in relational data base systems: architectural issues and design approaches
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
An experimental performance study of a pipelined recursive query processing strategy
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Data Partition and Parallel Evaluation of Datalog Programs
IEEE Transactions on Knowledge and Data Engineering
Parallel and Distributed Processing of Rules by Data-Reduction
IEEE Transactions on Knowledge and Data Engineering
Distributed Transitive Closure Computations: The Disconnection Set Approach
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Diagnosis of asynchronous discrete event systems: datalog to the rescue!
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
| Hi-index | 0.00 |
We propose a method of parallelizing bottom-up-evaluation of logic programs. The method does not introduce interprocess communication, or synchronization overhead. We demonstrate that it can be applied when evaluating several classes of logic programs, e.g., the class of linear single rule programs. This extends the work reported in [WS] by significantly expanding the classes of logic programs that can be evaluated in parallel. We also prove that there are classes of programs to which the parallelization method cannot be applied.