Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time

Details Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time

2006-08-07

arxiv.org/abs/cs/0608037v2

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

In this paper, the author proposes a series of multilevel double hashing schemes called cascade hash tables. They use several levels of hash tables. In each table, we use the common double hashing scheme. Higher level hash tables work as fail-safes of lower level hash tables. By this strategy, it could effectively reduce collisions in hash insertion. Thus it gains a constant worst case lookup time with a relatively high load factor(70%-85%) in random experiments. Different parameters of cascade hash tables are tested.

Affiliated with

Also associated with

No associations

Rating

Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cascade hash tables: a series of multilevel double hashing schemes with O(1) worst case lookup time will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-600833