时间复杂度为O(N)的联接算法

A Join Algorithm with the Time Compexity O(N)

本文提出基于Ｈａｓｈ位阵列结构的等值联接算法，它利用Ｈａｓｈ位阵列及链表来实现等值匹配查找，时间复杂度为Ｏ（Ｎ），而且实现此算法的结构比较简单，容易实现。普通联接算法的时间复杂度为Ｏ（Ｎ２）

This paper gives a Join algorithm based on the Hash Bit Array structure.It uses the structure and hardware lists to implement the search of equal matching.The time complexity of this algorithm is O(N).The hardware structure is simple and easy to implement.The time complexity of an ordinary Join algorithm is O(N 2).