The Community for Technology Leaders
Green Image
<p>Taking advantage of the structure of logical representations, we report an algorithm that evaluates conjunctive queries in a massively parallel environment under an object-based representation for deductive databases. By distributing objects in a database, we show that parallel evaluation of a query can be achieved in a cooperative way so that the conventional tuple-by-tuple, operation-by-operation evaluation strategy can be replaced by a global, parallel matching approach. With the proposed scheme, all conjuncts of a given query can be examined at the same time, which enables us to eliminate the need of any temporary relation. On the other hand, compared with the interpretive method, we show that any data dependency imposed by shared variables is no longer a major problem in achieving AND-parallelism by the proposed scheme.</p>
object-oriented databases; parallel programming; deductive databases; knowledge based systems; distributed databases; object-oriented query evaluation scheme; logical databases; massively parallel environment; logical representations; conjunctive queries; object-based representation; deductive databases; parallel evaluation; parallel matching approach; interpretive method; data dependency; shared variables; AND-parallelism

W. Lee and P. Sheu, "An Object-Oriented Query Evaluation Scheme for Logical Databases in Massively Parallel Environment," in IEEE Transactions on Knowledge & Data Engineering, vol. 6, no. , pp. 181-187, 1994.
94 ms
(Ver 3.3 (11022016))