On compiling queries in recursive first-order databases
Journal of the ACM (JACM)
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
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.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Computer
Sorting Large Files on a Backend Multiprocessor
IEEE Transactions on Computers
Distributed processing of logic programs
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Fuzzy querying with SQL: extensions and implementation aspects
Fuzzy Sets and Systems - Mathematical Modelling
Multiprocessor transitive closure algorithms
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
A logical language for data and knowledge bases
A logical language for data and knowledge bases
Automatic text processing
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Optimal parallel evaluation of AND trees
Journal of Parallel and Distributed Computing
Hybrid transitive closure algorithms
Proceedings of the sixteenth international conference on Very large databases
FastSort: a distributed single-input single-output external sort
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
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
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel database systems: the future of high performance database systems
Communications of the ACM
Join and Semijoin Algorithms for a Multiprocessor Database Machine
ACM Transactions on Database Systems (TODS)
Parallel algorithms for the execution of relational database operations
ACM Transactions on Database Systems (TODS)
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
Parallel sorting on a shared-nothing architecture using probabilistic splitting
PDIS '91 Proceedings of the first international conference on Parallel and distributed information systems
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
IEEE Transactions on Knowledge and Data Engineering
A Spanning Tree Transitive Closure Algorithm
Proceedings of the Eighth International Conference on Data Engineering
Efficient Processing of Nested Fuzzy SQL Queries
ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Parallel Sorting Methods for Large Data Volumes on a Hypercube Database Computer
IWDM '89 Proceedings of the Sixth International Workshop on Database Machines
An Evaluation of Non-Equijoin Algorithms
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
SVP: A Model Capturing Sets, Lists, Streams, and Parallelism
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Practical Skew Handling in Parallel Joins
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Theory of Relational Databases
Theory of Relational Databases
| Hi-index | 0.00 |
A parallel scheme using the divide-and-conquermethod is developed. This partitions the input set of a problem intosubsets, computes a partial result from each subset, and finally employs amerging function to obtain the final answer. Based on a linear recursiveprogram as a tool for formalism, a precise characterization for problems tobe parallelized by the divide-and-conquer method isobtained. The performance of the parallel scheme is analyzed, and anecessary and sufficient condition to achieve linear speedup is obtained.The parallel scheme is generalized to include parameters, and a realapplication, the fuzzy join problem, is discussed indetail using the generalized scheme.