Probabilistic Data Structures and Algorithms for Big Data Applications [Russian]

By Andrii Gakhov

Probabilistic data structures is a common name for data structures based mostly on different hashing techniques. Unlike regular (or deterministic) data structures, they always provide approximated answers but with reliable ways to estimate possible errors. Fortunately, the potential losses and errors are fully compensated for by extremely low memory requirements, constant query time, and scaling, the factors that become essential in Big Data applications.

• Format: Paperback
• Language: Russian
• ISBN: 334754322X
• ISBN13: 9783347543225
• Release Date: August 2022
• Publisher: Gakhov
• Length: 228 Pages
• Weight: 0.67 lbs.
• Dimensions: 0.5" x 5.8" x 8.3"