Applied Math · Data Structures and Algorithms

Hashing Explained

Demystifying Hashing Hashing is a broadly studied topic among mathematicians, in fact Hash Functions are attractive mainly for their┬ámany applications in the modern Computer Science. Very often, it is possible to see confusion speaking about Hashing. People confuse Hashing with Base-changes (e.g. from Base-10 to Base-32 or Base-8); some other confuse Hashing with Random Number… Continue reading Hashing Explained

Applied Math · Data Structures and Algorithms · Distributed Computing · News from the Web

Sketch of the Day: HyperLogLog — Cornerstone of a Big Data Infrastructure

Intro In the Zipfian world of AK, the HyperLogLog distinct value (DV) sketch reigns supreme. This DV sketch is the workhorse behind the majority of our DV counters (and we’re not alone) and enables us to have a real time, in memory data store with incredibly high throughput. HLL was conceived of by Flajolet et.…

Applied Math · Performance · Real-time and Other · Throughput

Queueing Theory Explained

Let’s start this post with an extract of Murphy’s Law. If you change queue, the one that you left will start to move faster than the one you are in now. Your queue always goes the slowest. Whatever queue you join, no matter how short it looks, it will always take the longest to you… Continue reading Queueing Theory Explained