Please use this identifier to cite or link to this item:
|標題:||A displacement addressing method for letter-oriented keys||作者:||Wang, S.J.
|關鍵字:||displacement;letter-orient;minimal perfect hashing;Chinese remainder;theorem||Project:||Journal of Systems and Software||期刊/報告no：:||Journal of Systems and Software, Volume 46, Issue 1, Page(s) 77-88.||摘要:||
In this paper, a new method for minimal perfect hashing is proposed. Our scheme can process a rather large set of keywords and does not care the problem of letter-selection on each keyword. Our scheme employs the displacement of letters on each keyword to set up a minimal perfect hashing function. According to our experiments, up to one thousand keywords could be handled easily. Moreover, our scheme could be employed to handle more large key set if we subdivide such a key set into several proper-size subsets and apply our hashing function to them, respectively. (C) 1999 Elsevier Science Inc. All rights reserved.
|Appears in Collections:||期刊論文|
Show full item record
TAIR Related Article
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.