Probabilistic Data Structures

This book “Probabilistic Data Structures” is an Introduction to Probabilistic Data Structures and aims to introduce the readers to ideas of randomness in Data Structure design.
Contents of this book:
• Preface
• Introduction to Probabilistic Data Structures
• List of Probabilistic Data Structures
• Probabilistic Algorithms and Link with Data Structures
• Basic Probabilistic Data Structures
• Count Min Sketch
• MinHash
• LogLog
• Bloom Filter
• Skip List
• Significance in Real Life/ Conclusion


It is easier to understand randomness in algorithms with examples such as randomly splitting array in Quick Sort but most programmers fail to realize that Data Structures can be probabilistic as well.
In this, not only the answer is probabilistic but also the structure.
In fact, Google’s Chrome browser uses a Probabilistic Data Structure within it. Read on to find out which data structure it is and how it is used.

The ideas have been presented in a simple language (avoiding technical terms) with intuitive insights which will help anyone to go through this book and enjoy the knowledge.
This knowledge will help you to design better systems suited for real use.

---------------------------------------------------------------
Authors: Aditya Chatterjee, Ethan Z. Booker
Aditya is a Founding member at OpenGenus; Ethan has been an Intern at OpenGenus and a student at University of Wisconsin, La Crosse;