Simple implementation of deletion from open-address hash table

Details Simple implementation of deletion from open-address hash table Simple implementation of deletion from open-address hash table

2009-09-14

arxiv.org/abs/0909.2547v1

Computer Science

Data Structures and Algorithms

6 pages

Scientific paper

Deletion from open-address hash table is not so easy as deletion from chained hash table, because in open-address table we can't simply mark a slot containing deleted key as empty. Search for keys may become incorrect. The classical method to implement deletion is to mark slots in hash table by three values: "free", "busy", "deleted". That method is easy to implement, but there are some disadvantages. In this article we consider alternative method of deletion keys, where we avoid using the mark "deleted". The article contains the implementation of the method in Java.

Affiliated with

Also associated with

No associations

Rating

Simple implementation of deletion from open-address hash table 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 Simple implementation of deletion from open-address hash table, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Simple implementation of deletion from open-address hash table will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-564864