A hashing technique using separate binary tree
Blekinge Institute of Technology, Department of Telecommunications and Signal Processing2006 (English)In: Data Science Journal, ISSN 1683-1470, Vol. 5, 143-161 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
Paris: Committee on Data for Science and Technology (CODATA) International Council for Science (ICSU) , 2006. Vol. 5, 143-161 p.
Database, Hashing, Information retrieval
Telecommunications Signal Processing
IdentifiersURN: urn:nbn:se:bth-8375Local ID: oai:bth.se:forskinfo1AB2DD5063F8FD9CC12574FE00334107OAI: oai:DiVA.org:bth-8375DiVA: diva2:836086
Open Access Journal2012-09-182008-11-112015-06-30Bibliographically approved