A hashing technique using separate binary tree

Data Science Journal

Mehedi Masud³  Anisur Rahman¹  Arunashis Ghose⁴  Gopal Chandra Das² 

[1] Computer Science and Engineering, Khulna University;Computer Science and Automation, Indian Institute of Science;School of Information Technology and Engineering, University of Ottawa;Department of Telecommunication and Signal Processing, Blekinge Institute of Technology

关键词: Database;    Hashing;    Information retrieval;   

DOI  :  10.2481/dsj.5.143

学科分类：计算机科学（综合）

来源: Ubiquity Press Ltd.

【 摘 要 】

References(11)It is always a major demand to provide efficient retrieving and storing of data and information in a large database system. For this purpose, many file organization techniques have already been developed, and much additional research is still going on. Hashing is one developed technique. In this paper we propose an enhanced hashing technique that uses a hash table combined with a binary tree, searching on the binary representation of a portion the primary key of records that is associated with each index of the hash table. The paper contains numerous examples to describe the technique. The technique shows significant improvements in searching, insertion, and deletion for systems with huge amounts of data. The paper also presents the mathematical analysis of the proposed technique and comparative results.

【 授权许可】

Unknown