期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2013
卷号：57
期号：2
出版社：Journal of Theoretical and Applied
摘要：Hash tables are extensively used in data structures to implement tables that associate a set of keys to a set of values, as they provide O(1), to perform operations such as query, insert and delete operations. However, at moderate collisions are quite frequent which not only increases the access time, but also decrease the performance in the deterministic. Due to this deterministic performance, the hash table degrades. In some systems, it is very difficult to keep the hash operations more deterministic. In recent trends, more research papers have been proposed, which employs a new and fast hash functions to implement hash tables and to avoid collisions. In this paper, we propose a novel hash table implementation called Hashsort function, which reduces the Collisions occur in the hash table. The basic idea of this paper is to reduce the collisions, such that automatically it increases the access time. High performance can be obtained by reducing the collisions in the hash table. Hashsort, makes an easy choice for the implementation of hash table in data structure.
关键词：Collision; Hashsort; Hash table; Sorting; Data structures.
