Hash Table with Expanded-Key for High-Speed Networking

Seon-Ho SHIN  Jooyoung LEE  Jong-Hyun KIM  Ikkyun KIM  MyungKeun YOON  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E99-D   No.3   pp.747-750
Publication Date: 2016/03/01
Publicized: 2015/12/11
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2015EDL8201
Type of Manuscript: LETTER
Category: Fundamentals of Information Systems
Keyword: 
hash table,  Bloom filter,  multiple hash functions,  

Full Text: PDF(978.5KB)>>
Buy this Article




Summary: 
We design a new hash table for high-speed networking that reduces main memory accesses even when the ratio of inserted items to the table size is high, at which point previous schemes no longer work. This improvement comes from a new design of a summary, called expanded keys, exploiting recent multiple hash functions and Bloom filter theories.