Research Papers
A hashing technique using separate binary tree
Authors:
Md Mehedi Masud ,
School of Information Technology and Engineering, University of Ottawa, Canada, CA
Gopal Chandra Das,
Computer Science and Automation, Indian Institute of Science (IISc), Bangalore, India, IN
Md Anisur Rahman,
Computer Science and Engineering, Khulna University, Khulna, Bangladesh, BD
Arunashis Ghose
Department of Telecommunication and Signal Processing, Blekinge Institute of Technology, Karlskrona, Sweden, SE
Abstract
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.
How to Cite:
Masud, M.M., Das, G.C., Rahman, M.A. and Ghose, A., 2006. A hashing technique using separate binary tree. Data Science Journal, 5, pp.143–161. DOI: http://doi.org/10.2481/dsj.5.143
Published on
28 Nov 2006.
Peer Reviewed
Downloads
