A hashing technique using separate binary tree

Document type: Journal Articles
Article type: Original article
Peer reviewed: Yes
Author(s): Mehedi Masud, Gopal Chandra Das, Anisur Rahman, Arunashis Ghose
Title: A hashing technique using separate binary tree
Journal: Data Science Journal
Year: 2006
Volume: 5
Pagination: 143-161
ISSN: 1683-1470
Publisher: Committee on Data for Science and Technology (CODATA) International Council for Science (ICSU)
City: Paris
Organization: Blekinge Institute of Technology
Department: Department of Telecommunications and Signal Processing (Institutionen för telekommunikation och signalbehandling)
Department of Telecommunications and Signal Processing S-372 25 Ronneby
+46 455 38 50 00
Language: English
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.
Subject: Telecommunications\General
Signal Processing\General
Keywords: Database, Hashing, Information retrieval
Note: Open Access Journal
Edit
Address: Blekinge Institute of Technology, SE-371 79 Karlskrona, Sweden
  • Phone: + 46 455 38 50 00
  • Fax: + 46 455 38 50 57
  • Responsible for page: Peter Linde
  • Page modified: 09/18/2012