SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
In-memory hash tables provide fast access to large numbers of strings, with less space overhead than sorted structures such as tries and binary trees. If chains are used for collis...