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.
Seon-Ho SHIN
Kookmin University
Jooyoung LEE
Electronics and Telecommunications Research Institute (ETRI)
Jong-Hyun KIM
Electronics and Telecommunications Research Institute (ETRI)
Ikkyun KIM
Electronics and Telecommunications Research Institute (ETRI)
MyungKeun YOON
Kookmin University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Seon-Ho SHIN, Jooyoung LEE, Jong-Hyun KIM, Ikkyun KIM, MyungKeun YOON, "Hash Table with Expanded-Key for High-Speed Networking" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 3, pp. 747-750, March 2016, doi: 10.1587/transinf.2015EDL8201.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2015EDL8201/_p
Copy
@ARTICLE{e99-d_3_747,
author={Seon-Ho SHIN, Jooyoung LEE, Jong-Hyun KIM, Ikkyun KIM, MyungKeun YOON, },
journal={IEICE TRANSACTIONS on Information},
title={Hash Table with Expanded-Key for High-Speed Networking},
year={2016},
volume={E99-D},
number={3},
pages={747-750},
abstract={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.},
keywords={},
doi={10.1587/transinf.2015EDL8201},
ISSN={1745-1361},
month={March},}
Copy
TY - JOUR
TI - Hash Table with Expanded-Key for High-Speed Networking
T2 - IEICE TRANSACTIONS on Information
SP - 747
EP - 750
AU - Seon-Ho SHIN
AU - Jooyoung LEE
AU - Jong-Hyun KIM
AU - Ikkyun KIM
AU - MyungKeun YOON
PY - 2016
DO - 10.1587/transinf.2015EDL8201
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2016
AB - 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.
ER -