The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases

Simple item page
dc.creatorAkinwalle, A. T.
dc.creatorIbharalu, F. T.
dc.date2009-05-26
dc.date.accessioned2026-07-07T13:18:14Z
dc.date.available2026-07-07T13:18:14Z
dc.descriptionIn this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits. These functions are used in different levels of hash tables that are coded in Java Programming Language and a quite number of data records serve as primary data for testing the performances. The result shows that the two-level hash tables with three different hash functions give a superior performance over one-level hash table with two hash functions or zero-level hash table with one function in term of reducing the conflict keys and quick lookup for a particular element. The result assists to reduce the complexity of join operation in query language from O(n2) to O(1) by placing larger query result, if any, in multilevel hash tables with multiple hash functions and generate shorter query result.
dc.description10 pages, exposed on 5th International Conference "Actualities and Perspectives on Hardware and Software" - APHS2009, Timisoara, Romania
dc.identifierhttps://arxiv.org/abs/0905.4201
dc.identifierhttp://arxiv.org/abs/0905.4201
dc.identifierAnn. Univ. Tibiscus Comp. Sci. Series VII(2009),11-20
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/231365
dc.subjectData Structures and Algorithms
dc.subjectDatabases
dc.titleThe Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases
dc.typetext

Files

Collections

arXiv