© 2007 Julian Dyke
Result Cache Bloom Filter
Invented by Burton H Bloom in 1970
Space-efficient probabilistic data structure that is used to test whether an element is a member of a set.
False positives are possible, but false negatives are not.
Elements can be added to the set, but not removed
The more elements that are added to the set, the larger the probability of false positives
Probably used by Oracle to check if dependency objects already exist in result cache