Probabilistic Data Structure
Everything on SkillVeris tagged Probabilistic Data Structure — collected across the glossary, study notes, blog, and cheat sheets.
3 resources across 1 library
Interview Questions(3)
What is a Bloom Filter and How Do Databases Use It?
A Bloom filter is a compact, probabilistic data structure that tests whether an element is possibly in a set or definitely not in it, letting a database quickl…
What is a Bloom Filter?
A Bloom filter is a space-efficient probabilistic data structure that tests whether an element is possibly in a set or definitely not in a set, using a bit arr…
What is a Skip List?
A skip list is a probabilistic, layered linked-list structure that keeps elements sorted and adds multiple levels of 'express lane' pointers above the base lis…