- [Home]
- [Research achievement]
- [Research achievement detail]
| Title | Mathematical model for key search by hashing, and asymptotic evaluation on efficiency of search (in Japanese) |
|---|---|
| Authors | 二神常爾 、松嶋敏泰 、平澤茂一 |
| Released Year | 1997 |
| Format | Conference |
| Category | Others |
| Jounal Name | |
| Jounal Page | vol.97, no.80, pp.79-84 |
| Published Year | 1997 |
| Published Month | 5 |
| Abstract （English） |
In this study, an algorithm in which records stored in secondary storage by hashing are efficiently searched is proposed. Keys inherent to records and a quary are represented by binary vectors, and records having keys close to a quary in the Hamming space are searched. The search for all records leads to large access time to secondary storage. In this study, an algorithm was proposed that a vector representing a key of a record are divided into some blocks, and Hamming distances between a record and some code words in each block are stored in RAM. The condition that a number of searched records decreases in the proposed method compared with the previous method is found when the length of a vector is large enough. |
| Note （English） |
1 |
| Manuscript | |
| Presentation |
