关系排序的一种硬件实现

本文提出了一种利用硬件实现关系排序的模型，该模型采用总线相联的细胞阵列结构形式。它适宜于用ＶＬＳＩ实现，关系元组沿阵列管道边传输边排序，传输与排序同时完成，元组的串入串出满足计算机顺序存取的要求，利用ｎ个细胞对ｎ个元组排序只需２ｎ步，输入和输出各ｎ步，时延为零，尤其重要的是，输出的序列就是排了序的元组本身。

HARDWARE IMPLEMENTATION OF THE RELATIONAL SORTING

A hardware sorting scheme,which employs the Bus-connected Cellular Array(BCA) structure and is suitable for VLSI implementation,is proposed in this paper.The relational tuples are sorted as they move along the tarray.The sense-in and series-out of the tuples satisfy the computer's requirement of one-byone access.For the sorting of n tuples,n cells are needed and 2n times are consumed.The delay time is zero.Most importantly,the outputs are tuples themselves sorted.