Because each pair of filters only contains keys that are in the map " and " produced false positives on all previous filter pairs, the number of keys is extremely likely to quickly drop to a very small quantity that can be easily stored in an ordinary deterministic map, such as a pair of small arrays with linear search.
42.
Determining set membership in a plain list, as opposed to determining set membership in a trie, requires binary search, O ( " k & thinsp; log ( n ) " ) time; linear search, O ( " kn " ) time; or some other method whose execution time is in some way dependent on the total number, " n ", of all of the keys in the worst case.
