January 2021
Intermediate to advanced
322 pages
7h 23m
English
Oftentimes while processing streaming IoT data, searching for a particular item is required with minimum latency and space. The aim of membership query probabilistic data structures (MSQ PDS) is to check the presence of an element x in a large set of elements. The membership query operation using a linked list, array or a balanced binary tree requires a memory space linear to the size of set S. Hash table also has a larger size so, the memory it takes will also be larger. On the other hand, MSQ PDS are getting popular for handling queries of big data and streaming applications as these data structures consume less memory. Also, MSQ PDS ...
Read now
Unlock full access