Searching a single bloom filter is O(k). Searching many is O(N). And for most general solutions to the index/order problem to nothing is faster than the linear search.
Claude On Mon, Aug 31, 2015 at 9:44 AM, Rob Vesse <[email protected]> wrote: > On 30/08/2015 00:18, "Claude Warren" <[email protected]> wrote: > > >Quickly searching a large collection of bloom filters. > > This is O(k) where k is a constant so even with lots of filters isn't this > still a constant time operation? > > Rob > > > > > -- I like: Like Like - The likeliest place on the web <http://like-like.xenei.com> LinkedIn: http://www.linkedin.com/in/claudewarren
