.png){kind=icon}
返回
A parallel join algorithm for SIMD architectures
.png){kind=icon}
PRE
AI
DOI：10.1016/S0164-1212(97)00056-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a parallel join algorithm for the data-parallel execution model used in SIMD architectures. This algorithm is hash-based, i.e., the tuples in a relation are divided into different buckets based on the hash value of the join attribute. In this algorithm the buckets are maintained in a distributed fashion, i.e., the tuples in a bucket are stored in an array of processors. The join operation is performed in parallel over all the buckets. The algorithm presented here has been implemented and evaluated on the Connection Machine (CM-2). We present here the results of the experimental evaluation of this algorithm for different values of design parameters and work-load. Using experimental evaluations of the CM communication primitives we develop analytical models for the performance evaluation of this algorithm and demonstrate the effectiveness of these models. (C) 1997 Elsevier Science Inc.
Keyword:
DATABASE OPERATIONS
CONNECTION MACHINE
SYSTEM
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.1
论文数:
5.4K
被引数:
8.4K
机构
暂无机构信息
引用论文
分享收藏
分享收藏分享收藏Regulation of the length of the fertile period in the domestic fowl by numbers of oviducal spermatozoa, as reflected by those trapped in laid eggs.png)
Reproduction
OAAI
ReproductionIF0
OAAI分享收藏
查看更多内容