WEKO3
アイテム
Performing Set Operations by Using Hashing Techniques
https://ipsj.ixsq.nii.ac.jp/records/60058
https://ipsj.ixsq.nii.ac.jp/records/60058461fb06b-8ee1-448f-ae6c-223b51d4ff98
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-InfP1700015.pdf (451.1 kB)
|
Copyright (c) 1977 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | InfP(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 1977-01-01 | |||||||
| タイトル | ||||||||
| タイトル | Performing Set Operations by Using Hashing Techniques | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Performing Set Operations by Using Hashing Techniques | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Institute of Information Sciences University of Tsukuba | ||||||||
| 著者所属 | ||||||||
| Department of Information Science Kyoto University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Institute of Information Sciences, University of Tsukuba | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Information Science, Kyoto University | ||||||||
| 著者名 |
Seiichi, Nishihara
Hiroshi, Hagiwara
× Seiichi, Nishihara Hiroshi, Hagiwara
|
|||||||
| 著者名(英) |
Seiichi, Nishihara
Hiroshi, Hagiwara
× Seiichi, Nishihara Hiroshi, Hagiwara
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | 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. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA00674393 | |||||||
| 書誌情報 |
Information Processing in Japan 巻 17, 号 0, p. 87-92, 発行日 1977-01-01 |
|||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
