|
Title:
|
OPTIMISING LARGE HASH TABLES FOR LOOKUP PERFORMANCE |
|
Author(s):
|
Sándor Juhász , Ákos Dudás |
|
ISBN:
|
978-972-8924-62-1 |
|
Editors:
|
Hans Weghorn and Ajith P. Abraham |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
bucket hashing, open hashing, lookup performance, data transformation, cache memory |
|
Type:
|
Full Paper |
|
First Page:
|
107 |
|
Last Page:
|
114 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Hash tables can provide fast mapping between keys and values even for voluminous data sets. Our main goal is to find a
suitable implementation having compact structure and efficient collision avoidance method. Our attention is focused on
maximizing the lookup performance when handling several millions of data items. This paper suggest a new memory
consumption oriented way for comparing the significantly different approaches and analyses various types of hash table
implementations in order to answer the question what structure needs to be used and how the parameters must be chosen
in order to achieve a maximal lookup performance with the lowest possible memory consumption. |
|
|
|
|
|
|
