Performing Set Operations by Using Hashing Techniques

概要

論文の詳細を見る
Performing set operations is one of the basic techniques in the fields of information retrieval, data structure and data base management. In this paper, it is shown that hashing techniques can effective1y be applied to performing set operations; where each set is a set of keys. Each entry of a hash table contains a key fie1d, a pointer field and a match level indicator field. The last field is used to indicate how well the key satisfies the set formula under consideration. Some algorithms to process set formulas containing no complementary set are given and the efficiency is proved by some experiments.
一般社団法人情報処理学会の論文