Last update: Sat Jan 6 02:03:49 MST 2018
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Chang:1986:LOM,
author = "C. C. Chang and R. C. T. Lee",
title = "A Letter-oriented Minimal Perfect Hashing Scheme",
journal = j-COMP-J,
volume = "29",
number = "3",
pages = "277--281",
month = jun,
year = "1986",
CODEN = "CMPJA6",
DOI = "https://doi.org/10.1093/comjnl/29.3.277",
ISSN = "0010-4620 (print), 1460-2067 (electronic)",
ISSN-L = "0010-4620",
bibdate = "Tue Dec 4 14:48:20 MST 2012",
bibsource = "Compendex database;
http://comjnl.oxfordjournals.org/content/29/3.toc;
http://www.math.utah.edu/pub/tex/bib/compj1980.bib;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/",
URL = "http://comjnl.oxfordjournals.org/content/29/3/277.full.pdf+html;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/tiff/277.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/tiff/278.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/tiff/279.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/tiff/280.tif;
http://www3.oup.co.uk/computer_journal/hdb/Volume_29/Issue_03/tiff/281.tif",
abstract = "In this paper, we shall describe a minimal perfect
hashing scheme suitable for letter-oriented keys. We
successfully applied this minimal perfect hashing
function to four non-trivial sets of keys: 12 months in
English, 34 non-printable ASCII identifiers, 31 most
frequently used English words and 36 Pascal reserved
words.",
acknowledgement = ack-nhfb,
affiliation = "Natl Chung Hsing Univ, Taichung, Taiwan",
affiliationaddress = "Natl Chung Hsing Univ, Taichung, Taiwan",
classcodes = "C6120 (File organisation)",
classification = "723; 903",
corpsource = "Inst. of Appl. Math., Nat. Chung Hsing Univ.,
Taichung, Taiwan",
fjournal = "The Computer Journal",
journal-URL = "http://comjnl.oxfordjournals.org/",
keywords = "ASCII; Chinese remainder theorem; data processing;
file organisation; File Organization; identifiers;
information science --- Information Retrieval;
key-collision problem; letter-oriented keys; minimal
perfect hashing scheme; Pascal reserved words",
treatment = "P Practical; T Theoretical or Mathematical",
}
Related entries
- applied,
23(2)146-1,
26(1)6
- ASCII,
32(5)445
- Chang, C. C.,
24(4)384-1,
24(4)384-2,
25(1)160,
30(3)249,
30(6)535,
31(6)565
- Chinese,
30(5)469
- describe,
26(3)235,
27(4)368-1,
31(6)496,
32(1)13,
32(2)108,
32(2)142
- English,
24(1)62,
32(5)422
- four,
24(3)271,
28(4)439
- function,
23(2)165,
23(3)286,
24(1)42,
25(3)379,
25(3)397,
25(4)448,
28(1)54,
29(1)9,
29(1)38,
29(4)289,
30(1)27,
31(1)17,
31(3)209,
31(3)229,
31(3)243,
31(6)510,
32(1)36,
32(1)93,
32(2)98,
32(2)122,
32(4)305,
32(5)461
- hashing,
25(3)358,
25(4)478,
25(4)486,
27(3)218,
28(1)54,
28(3)313,
28(3)319,
28(3)330,
29(5)436,
30(6)535
- key,
23(2)188,
25(3)327,
25(4)478,
25(4)486,
27(3)218,
27(3)270,
27(4)368-1,
28(3)291,
28(3)309,
28(3)343,
29(2)176,
29(4)368,
30(3)276-2,
30(6)535,
30(6)565
- minimal,
31(1)65
- most,
32(1)93,
32(2)175
- organisation,
23(1)37,
23(3)207,
24(1)29,
24(4)290,
25(1)158,
25(2)169,
25(2)193,
25(2)239,
25(3)327,
25(3)368,
26(1)43,
26(3)196,
27(2)143,
27(3)218,
27(3)270,
27(3)284,
27(4)321,
27(4)334,
28(1)54,
28(2)179,
28(3)203,
28(3)243,
28(3)291,
28(3)313,
28(3)319,
28(3)330,
28(4)391,
28(4)412,
28(4)414,
28(4)417,
28(4)426,
28(5)524,
29(1)52,
29(2)167,
29(4)368,
29(5)436,
29(6)522,
30(1)80,
30(6)529,
30(6)535,
30(6)565,
31(1)41,
31(5)426,
31(6)490,
31(6)517,
31(6)531,
31(6)540,
31(6)565,
32(1)63,
32(1)68,
32(3)212,
32(3)228,
32(4)323,
32(4)351,
32(6)494
- organization,
25(1)158,
25(2)169,
25(2)207,
25(3)327,
25(3)368,
27(2)143,
27(3)284,
27(3)284-1,
27(4)321,
28(3)313,
28(3)319,
28(3)330,
28(4)414,
28(5)524,
29(1)52,
29(4)368,
30(1)80,
30(4)343,
30(6)529,
30(6)535,
31(1)41,
31(3)253,
31(6)565,
32(3)262
- paper,
23(1)33,
24(1)95,
25(4)471,
26(2)109,
26(3)235,
27(3)288-2,
27(4)368-1,
28(1)1,
28(2)104-2,
28(4)446-1,
29(3)201,
29(4)289,
29(5)477-1,
31(5)457,
31(6)496,
32(2)98,
32(2)142,
32(2)152,
32(2)175,
32(5)422
- Pascal,
24(2)112,
25(1)17,
25(2)176,
25(2)248,
25(3)289,
25(3)340,
25(4)496,
26(2)164,
26(2)187,
26(4)366,
27(4)348,
27(4)373,
28(2)134,
28(3)270,
28(4)391,
29(2)176,
29(3)246,
29(5)423,
30(1)52,
30(3)277,
30(4)337,
30(4)355,
30(4)372,
31(1)1,
31(1)9,
31(6)553,
31(6)557,
32(2)152
- perfect,
28(1)54
- retrieval,
23(1)37,
23(2)131,
23(2)131-1,
24(4)312,
25(1)2,
25(1)158,
25(4)478,
26(2)106,
26(3)239,
26(4)336,
27(2)121,
28(1)54,
28(3)264,
28(3)319,
29(1)52,
29(5)460,
29(5)467,
29(6)481,
30(4)343,
30(5)420,
30(6)485,
31(1)41,
31(2)147,
31(6)550,
32(3)212,
32(3)220,
32(3)228,
32(4)333
- scheme,
24(3)256,
24(4)324,
25(2)235,
25(3)358,
26(1)10,
26(2)188,
27(1)18,
28(1)5,
28(4)375,
29(2)109,
30(2)189,
30(3)249,
30(4)298,
30(4)328,
32(1)16
- science,
23(2)98,
23(2)114-1,
23(2)146-1,
23(4)377,
24(1)91,
24(3)278,
25(1)2,
25(1)135,
25(2)183,
25(3)307,
26(1)1,
26(1)79,
26(2)142,
26(3)255,
26(3)270,
28(1)82,
28(2)112,
28(3)195,
28(3)200,
28(3)203,
28(3)206,
28(3)211,
28(4)375,
29(1)83,
29(1)90,
29(2)161,
29(2)189,
29(2)189-1,
29(3)212,
29(5)460,
29(5)467,
29(6)481,
30(1)52,
30(3)239,
30(4)343,
30(5)413,
30(5)458,
30(5)469,
30(6)485,
31(1)1,
31(2)182,
31(3)248,
31(5)386,
31(5)391,
31(5)398,
31(5)409,
31(5)420,
31(5)426,
31(5)431,
31(5)437,
31(5)445,
31(5)457,
31(5)465,
31(6)525,
31(6)531,
32(2)108,
32(3)262,
32(6)516
- set,
23(1)46,
23(2)107,
23(2)187,
24(2)184,
25(1)140,
25(2)183,
25(3)340,
27(1)72,
27(3)209,
27(3)283,
27(3)283-1,
27(4)294,
28(3)298,
28(4)406,
28(5)496,
30(3)258,
30(5)393,
30(5)437,
31(1)65,
31(3)283,
31(4)325,
32(1)86,
32(3)281,
32(4)370,
32(4)374
- suitable,
30(5)420,
32(6)571
- theorem,
27(1)8,
27(3)230,
28(2)105,
28(5)474,
31(1)17,
31(1)51,
31(6)510,
32(5)437
- used,
24(4)320,
25(3)358,
31(4)296,
31(6)496,
32(2)142
- word,
24(3)249,
25(1)2,
25(2)183,
26(1)68,
29(5)460,
30(4)343,
32(3)212,
32(3)246