4 search results - page 1 / 1 » Less Hashing, Same Performance: Building a Better Bloom Filt... |
ESA
2006
Springer
13 years 8 months ago
2006
Springer
A standard technique from the hashing literature is to use two hash functions h1(x) and h2(x) to simulate additional hash functions of the form gi(x) = h1(x) + ih2(x). We demonstra...
SIGCOMM
2005
ACM
13 years 10 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
GLOBECOM
2007
IEEE
13 years 10 months ago
2007
IEEE
—Bloom Filters (BFs) are fundamental building blocks in various network security applications, where packets from high-speed links are processed using state-of-the-art hardwareba...
ICDE
2005
IEEE
14 years 5 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...