首页   按字顺浏览 期刊浏览 卷期浏览 Addressing for letter‐oriented keys
Addressing for letter‐oriented keys

 

作者: Jinn‐Ke Jan,   Chin‐Chen Chang,  

 

期刊: Journal of the Chinese Institute of Engineers  （Taylor Available online 1988）
卷期: Volume 11, issue 3  

页码: 279-284

 

ISSN:0253-3839

 

年代: 1988

 

DOI:10.1080/02533839.1988.9677067

 

出版商: Taylor & Francis Group

 

关键词: minimal perfect hashing;letter‐oriented key

 

数据来源: Taylor

 

摘要:

This paper presents a new algorithm for hashing. In this approach each key (x, y) is denoted as a pair of letters, and it is extracted from each letter‐oriented key in the key space according to a certain pre‐determined extraction algorithm. For the keys (x, y), our hashing function hashes as follows:

 

点击下载:  PDF (370KB)



返 回