Navneet Pandey

Understanding Containers and Kubernetes Architecture

Containers 1. Docker containers share the kernel of the host: Docker containers run on a shared kernel but provide process and filesystem isolation. Each container has its own isolated filesystem, process space, and network stack while sharing the host machine's kernel. 2. Image is a package or template

Workflow Definitions and Executions with Temporal

In the realm of distributed systems, managing and orchestrating workflows efficiently is crucial. This blog post delves into these concepts, contrasting them with state-based execution engines, and highlighting the advantages of using Temporal for building reliable and scalable distributed applications. Workflow Definitions and Executions Workflow definitions can be thought of

db

Database Indexing Performance

Primary Key A primary key is a special type of index that enforces data integrity and ensures each row's uniqueness. When a primary key is defined on a table, the database management system automatically creates an index on the primary key column(s). This index allows for efficient

design-patterns

Microservice Choreography vs. Orchestration

Microservice Choreography and Orchestration are two different approaches to designing and managing interactions between microservices in a distributed system. Choreography Microservice Choreography is an architectural approach where microservices communicate directly with each other without a central orchestrator. It promotes loose coupling, decentralizes control, distributes complexity, relies on asynchronous communication, and

design-patterns

Single Table Inheritance

Single Table Inheritance commonly known as STI is a design pattern used in object-oriented programming where a single database table is used to store multiple types of related objects that share common attributes. The relational databases don't inherently support inheritance. However, STI is a technique used to represent

db

Database Indexing

An index is a data structure created on top of an existing table within a database. Its purpose is to improve the speed of data retrieval by providing a way to access quickly (fast lookups) the desired data without having to scan the entire table. A real-world example can be

design-patterns

Strategy Pattern

The Strategy pattern allows you to swap out different algorithms or strategies without changing the overall behaviour of the program. This pattern is part of behavioural design pattern. The Strategy pattern enables following the Open/Closed principle by promoting abstraction, encapsulation and loose coupling between interchangeable behaviours/algorithms and the

solid

Liskov Substitution Principle

The Liskov Substitution Principle (LSP) is a principle in object-oriented programming that suggests that objects of a superclass should be replaceable with objects of its subclasses. That means if a piece of code is designed to work with objects of a certain base class, it should also work correctly with

solid

Open Closed Principle

The Open/Closed Principle, a principle of object-oriented programming, emphasises that classes or methods should be designed in a way that allows for extension (adding new functionality) without modification (changing existing code). This principle promotes the idea of designing code that is flexible, maintainable, and resilient to change. The rationale

solid

Single Responsibility Principle

The Single Responsibility Principle (SRP) is a principle in object-oriented programming that suggests that a class should have only one reason to change. This means that a class should have a single responsibility or purpose, and should not be responsible for multiple unrelated tasks. By following the SRP, 1. classes

til

What is ULID?

ULID stands for Universally Unique Lexicographically Sortable Identifier, they are composed of a timestamp and a random component called entropy, which are combined to create a unique identifier. How? The timestamp component is a 48-bit integer that represents the number of milliseconds since midnight on January 1, 1970, UTC. The

tls

TLS 1.3

TLS 1.3 (Transport Layer Security) is the latest version of the TLS protocol, it provides improved security, faster connection times, simplified protocol, support for 0-rtt (zero round trip times) connections. TLS 1.3 is that the handshake process requires only one round trip between the client and server, the

db

What is connection pooling?

Connection pooling is a technique used in computer programming to improve the performance of applications that communicate with a database. It involves creating a pool or a cache of connections that can be reused by multiple requests, instead of creating a new connection every time a request is made. Connection

http

HTTP/2

HTTP/2 is a binary protocol, rather than the text-based format used by HTTP/1.1, which allows for more efficient processing of data. It also introduces several new features that improve the performance of web communication, will talk about them later. In HTTP/2 there is a binary framing

http

HTTP/1.1

In HTTP/1.1 (persistent connections or keep alive connections), the client can indicate that it wants to use a persistent connection by including the Connection: keep-alive header in its request. If the server supports persistent connections, it will respond with the same header to indicate that it will keep

http

HTTP/1.0

In HTTP 1.0 (short-lived connections), a new TCP connection was established for each request and response, and a three-way handshake was performed before each connection was opened. This meant that the connection was closed after each request was served, and a new connection had to be established for each

http

HTTP

Hypertext Transfer Protocol version is a protocol for transmitting data over the internet. It is the standard protocol used for web communication. When a client initiates a connection to a server using HTTP over TCP, the two endpoints first establish a connection through a three-way handshake. The three-way handshake is

tls

SSL/TLS

We had a production issue couple of days back, we had updated our SSL certificate and one of our consumers were not able to call the API due to some extra checks at there end. The certificate authenticity was failing at there end. This made to read more about how

design-patterns

Circuit Breaker Pattern

In the distributed system especially microservices there are lots are services working in together to full-fill a user request. Now think of a scenario where a service is experiencing high latency or has become unresponsive due to an unexpected issue, as this service will now take time to respond to

db

Partitioning and Sharding

Partitioning Partitioning refers to the process of dividing a large table(data) into smaller, more manageable segments or partitions in the same instance. Sharding Sharding involves distributing data across multiple database systems or instances. The data may be identical or distinct, depending on the specific use case. Sharding is often

basics

Load Balancing

Load balancing is a technique used to distribute workloads across multiple servers to improve performance by optimizing the resource utilization. Strategies Round Robin It done sequentially there is no logic to this, each request is assigned to the next available server in a circular order. This strategy distributes the load

golang

Managing multiple Go programs with main functions in a single folder

When you have multiple Go files in the same folder, each containing a main function, you'll encounter a problem when trying to build or run your program. Go treats all files in the same folder as part of the same package, and having multiple main functions in a

db

DB Locking

Lock Granularity: It can be on rows, columns and table, also B+ tree page can be locked. Read Lock (Shared Lock) Locks the data for read for the current session Other sessions can not update the locked data, but Other sessions can read the locked data Write Lock (Exclusive Lock)

caching

caching..

write through cache: When data is written to the cache and the DB at the same time. write around cache: When the data is written into DB and when the user requests the data, it is a cache miss and then the data is loaded to cache storage. write back

basics

Marshalling and Unmarshalling

Marshalling is transforming the object into a byte stream for storage or transmission, in ruby when we push a object to redis for Sidekiq to fetch and process we use marshalling. 2.7.2 :004 > marshaled = Marshal.dump('this is an object') => "\x04\bI\"