Chapter 24: Advanced Indexing
Bloom Filters A bloom filter is a probabilistic data structure used to check membership of a value in a set May return true with low probability even if an element is not present But never returns false if an element is present
Embed this Presentation
Available Downloads
Download Notice
Download Presentation The PPT/PDF document "Chapter 24: Advanced Indexing" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.