Regular Section
Hash Table with Expanded-Key for High-Speed Networking
2016 Volume E99.D Issue 3 Pages 747-750
Details
2016 Volume E99.D Issue 3 Pages 747-750
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.
