摘要
求解对数据库进行全缩减的半联接序列及并行执行这些半联接序列,给出了链式查询全缩减并行计算的一个有效算法,并推广到树查询中.
The parallel processing for the full reductions of chain query and tree query is discussed. An efficient parallel algorithm to produce full reducers is presented. The chain query is given first, and thin extended to the tree query.
出处
《复旦学报(自然科学版)》
CAS
CSCD
北大核心
1995年第3期320-327,共8页
Journal of Fudan University:Natural Science