원문정보
초록
영어
The main idea behind any hash function is to find a one to one correspondence between a key value and an index in the hash table where the key value can be placed. In closed hashing, it is very difficult to handle the situation of table overflow in a satisfactory manner. Key values are haphazardly placed and generally majority of the keys are placed far away from their hash location. Thus, the number of probes is greatly increased which degrades the overall performance. To resolve this problem another hashing method known as open hashing (separate chaining) is employed. But this type of hashing is still not efficient in case of searching because here all the elements that have the same hash function are inserted in a sequential order. Due to this, traversal of all the previously inserted elements is required when we are searching for the last element. So the overall complexity will be O (n). In this paper, we propose a hybrid chaining model which is a combination of Binary Search Tree and AVL Tree to achieve a complexity of O (log n).
목차
1. Introduction
1.2 Properties of a Good hash Function
1.3 Avl Trees
1.4 Binary Search Tree
2. Existing System
2.1 Collision Resolution
2.2 Chaining
2.3 Open Addressing
2.4 Problem:
2.5 Separate Chaining:
2.6 Complexity of Separate Chaining
2.7 How to Choose M in Separate Chaining?
2.8 Other Methods of Chaining:
3. Proposed System
4. Methodology
References