Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
Flavio Bonomi, Michael Mitzenmacher, Rina Panigrah...
This paper presents an algorithm for exact pattern matching based on a new type of Bloom filter that we call a feed-forward Bloom filter. Besides filtering the input corpus, a ...
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
— Network measurement at 10+Gbps speeds imposes many restrictions on the resource consumption of the measurement application, making any filtering of input data highly desirable...
Brad Whitehead, Chung-Horng Lung, Peter Rabinovitc...