X hits on this document

85 views

0 shares

0 downloads

0 comments

22 / 38

22

juliandyke.com

© 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

Document info
Document views85
Page views85
Page last viewedSun Dec 04 01:28:52 UTC 2016
Pages38
Paragraphs703
Words2667

Comments