Arpit – Medium

Arpit

Bitcask — a log-structured fast KV store

Bitcask is one of the most efficient embedded Key-Value (KV) Databases designed to handle production-grade traffic. The paper that…

6 min readJul 19, 2020

--

1

Bitcask — a log-structured fast KV store

--

1

Arpit

Phi φ Accrual Failure Detection

One of the most important virtues of any distributed system is its ability to detect failures in any of its subsystems before things go…

5 min readJul 12, 2020

--

Phi φ Accrual Failure Detection

--

Arpit

Deciphering Single-byte XOR Ciphertexts

Encryption is a process of encoding messages such that it can only be read and understood by the intended parties. The process of…

7 min readJun 21, 2020

--

Deciphering Single-byte XOR Ciphertexts

--

Arpit

Making Python Integers Iterable

Iterables in Python are objects and containers that could be stepped through one item at a time, usually using a for ... in loop. Not…

8 min readJun 14, 2020

--

Making Python Integers Iterable

--

Arpit

Powering inheritance in C using structure composition

C language does not support inheritance however it does support Structure Compositions which can be tweaked to serve use-cases requiring…

7 min readJun 7, 2020

--

1

Powering inheritance in C using structure composition

--

1

Arpit

The RUM Conjecture

The RUM Conjecture states that we cannot design an access method for a storage system that is optimal in all the following three aspects —…

5 min readMay 31, 2020

--

The RUM Conjecture

--

Arpit

Consistent Hashing

Consistent hashing is a hashing technique that performs really well when operated in a dynamic environment where the distributed system…

10 min readMay 24, 2020

--

2

Consistent Hashing

--

2

Arpit

Python Caches Integers

An integer in Python is not a traditional 2, 4, or 8-byte implementation but rather it is implemented as an array of digits in base 2³⁰…

4 min readMay 17, 2020

--

Python Caches Integers

--

Arpit

Fractional Cascading — Speeding up Binary Searches

Binary Search is an algorithm that finds the position of a target value in a sorted list. The algorithm exploits the fact that the list is…

9 min readMay 11, 2020

--

Fractional Cascading — Speeding up Binary Searches

--

Arpit

Copy-on-Write Semantics

Copy-On-Write, abbreviately referred to as CoW suggests deferring the copy process until the first modification. A resource is usually…

7 min readMay 11, 2020

--

1

Copy-on-Write Semantics

--

1

Arpit

Arpit

Principal Engineer @Unacademy • Data @amazon • Platform @practo | Writes about Language internals, System Design, Programming and Math in Computer Science.

Following

Help
Status
About
Careers
Blog
Privacy
Terms
Text to speech
Teams