Re: Hashing for big list of last names
- From: "sprash" <sprash@xxxxxxxxx>
- Date: 13 Sep 2006 21:12:29 -0700
To put it simply, the module I am writing essentially reads the list of
last names of Patients from a CSV file which is a very large list.
Next, based on the inputs I get from another application, I need to
manipulate this list by searching and inserting new last names and also
delete certain last names from my list.
There is existing legacy code that is implementing this using chaining
( function is based on the first character of the last name). This
causes a lot of collision for common characters such as A, D etc and
very few for X, Q etc. Basically the distribution is understandably
uneven.
I am wondering if there are any better ideas out there.
Ben Pfaff wrote:
sprash25@xxxxxxxxx writes:
I would like to design a hash table for a big list of last names of
patients.
Any recommendations on the hashing type (chaining, open addressing,
double hashing) and the function I should use?
It entirely depends on your constraints. If you describe your
application in some more detail, perhaps we can give
recommendations.
--
Ben Pfaff
email: blp@xxxxxxxxxxxxxxx
web: http://benpfaff.org
.
- Follow-Ups:
- Re: Hashing for big list of last names
- From: dcorbit
- Re: Hashing for big list of last names
- From: Ben Pfaff
- Re: Hashing for big list of last names
- From: Logan Shaw
- Re: Hashing for big list of last names
- From: CBFalconer
- Re: Hashing for big list of last names
- References:
- Hashing for big list of last names
- From: sprash25
- Re: Hashing for big list of last names
- From: Ben Pfaff
- Hashing for big list of last names
- Prev by Date: Re: Hashing for big list of last names
- Next by Date: Re: Hashing for big list of last names
- Previous by thread: Re: Hashing for big list of last names
- Next by thread: Re: Hashing for big list of last names
- Index(es):
Relevant Pages
|