OLTP vs OLAP

OLTP and OLAP are two types of databases that are optimized for different types of workloads. In this article, we will discuss the differences between OLTP and OLAP systems, their characteristics, and how they are used in real-world scenarios.

 · 5 min · 1013 words · Bá Tới

Nginx Stream Module: A Quick Guide

A quick guide to the Nginx Stream module: enabling it, proxying and load balancing TCP/UDP traffic, TLS termination, and how it differs from the HTTP module.

 · 4 min · 707 words · Bá Tới

Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 3

Explore algorithms based on divide and conquer principles in Ruby, including Kruskal’s algorithm for minimum spanning tree, line intersection, and parallel algorithms for connected components, with examples and implementations.

 · 4 min · 773 words · Bá Tới

Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 2

Explore some algorithms based on divide and conquer principles in Ruby, including the Master Theorem, Fast Walsh-Hadamard Transform, Counting Inversions, Skyline Problem, Maximum Subarray Problem, Sparse Table, Planar Point Location, Maximum Flow Problem, Dynamic Programming Optimization, and Discrete Fourier Transform.

 · 10 min · 1910 words · Bá Tới

Some Algorithms Based on Divide and Conquer Principles in Ruby - Part 1

Some example of divide and conquer algorithms in Ruby, including binary Karatsuba Algorithm, Fast Fourier Transform (FFT), Closest Pair of Points, Convex Hull, Optimal Binary Search Tree, VLSI Layout, Tower of Hanoi, Multipoint Polynomial Evaluation and Interpolation, Medians and Order Statistics, Ternary Search.

 · 11 min · 2266 words · Bá Tới

Linked List Algorithms in Ruby

Learn about linked list algorithms in Ruby, including linked list traversal, insertion, deletion, and reversal, with examples and comparisons of their performance.

 · 2 min · 364 words · Bá Tới

Divide and Conquer Algorithms

Learn about divide and conquer algorithms in Ruby, including binary search, merge sort and quick sort, with examples and comparisons of their performance.

 · 3 min · 529 words · Bá Tới

Backtracking Algorithms in Ruby

Learn about backtracking algorithms in Ruby, including the N-Queens problem, Sudoku solver, and Knight’s tour problem, with examples and comparisons of their performance.

 · 8 min · 1646 words · Bá Tới

Greedy Algorithms in Ruby

Learn about greedy algorithms in Ruby, including the greedy algorithm paradigm, examples of greedy algorithms, and their applications in solving optimization problems.

 · 6 min · 1242 words · Bá Tới

Graph Algorithms in Ruby

Learn about graph algorithms in Ruby, including depth-first search (DFS), breadth-first search (BFS), Dijkstra’s algorithm, and A* search, with examples and comparisons of their performance.

 · 6 min · 1252 words · Bá Tới