SpringerPlus

Table 8 Comparison of on-chip requirements of different Bloom filter-based summaries for n=10 ⁶

From: Efficient hash tables for network applications

Summary	Size (KiB)	bpi	Eq., parameter
FHT	6292	50.33	4, c=12.8, b=3
SF lazy	5508	44.06	6,8. c=1
SF counting	30023	240.18	6,11, c=1, v=2, d=6
MBF lazy	2742	21.93	6,9, c=1
MBF counting	8347	66.77	6,10, c=1
Segmented	2000	16
Peacock	223	1.78	r=0.1
Discriminator	500	4

Back to article page