Probabilistic Data Structures

In data structures we want to search a particular or min element. When data set is small then using *Deterministic data structures(Eg: Hashtable, minHeap)* solves the purpose somehow.
But when data set becomes Huge and unmanagable(BIG DATA), Deterministic DS cannot be used because DATA WILL NOT FIT IN MEMORY.
Eg: Streaming applications which need data to be processed in one pass and perform incremental updates.

PDS support union and intersection operations and therefore can be easily parallelized.