An amateur's introduction to recursive query processing strategies
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
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 parallel strategy for transitive closure using double hash-based clustering
Proceedings of the sixteenth international conference on Very large databases
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
An Effective Algorithm for Parallelizing Hash Joins in the Presence of Data Skew
Proceedings of the Seventh International Conference on Data Engineering
Static Estimation of Query Sizes in Horn Programs
ICDT '90 Proceedings of the Third International Conference on Database Theory
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
HaLoop: efficient iterative data processing on large clusters
Proceedings of the VLDB Endowment
Rule-based distributed and agent systems
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Distributed island-based query answering for expressive ontologies
GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
The HaLoop approach to large-scale iterative data analysis
The VLDB Journal — The International Journal on Very Large Data Bases
Distributed socialite: a datalog-based language for large-scale graph analysis
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Parallel bottom-up evaluation provides an alternative for the efficient evaluation of logic programs. Existing parallel evaluation strategies are neither effective nor efficient in determining the data to be transmitted among processors. In this paper, we propose a different strategy, for general Datalog programs, that is based on the partitioning of data rather than that of rule instantiations. The partition and processing schemes defined in this paper are more general than those in existing strategies. A parallel evaluation algorithm is given based on the semi-naive bottom-up evaluation. A notion of potential usefulness is recognized as a data transmission criterion to reduce, both effectively and efficiently, the amount of data transmitted. Heuristics and algorithms are proposed for designing the partition and processing schemes for a given program. Results from an experiment show that the strategy proposed in this paper has many promising features.