A hashing technique using separate binary tree

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• CODATAの論文

著者

• Masud Mehedi

  School of Information Technology and Engineering, University of Ottawa

• Ghose Arunashis

  Department of Telecommunication and Signal Processing, Blekinge Institute of Technology

• Das Gopal

  Computer Science and Automation, Indian Institute of Science

• Rahman Anisur

  Computer Science and Engineering, Khulna University

関連論文

• A hashing technique using separate binary tree

スポンサーリンク