May 20 · 15 min read · Have you ever wondered how a database with tens of millions of records can return your query result in under a millisecond? The answer is indexing — one of the most elegant and practical ideas in comp
Join discussion
Feb 12 · 10 min read · Understanding B-Tree vs LSM-Tree Storage Engines B-Tree storage engines organize data in sorted, balanced tree structures stored on disk. Each node contains keys and pointers, with leaf nodes holding actual data or references to data pages. Updates m...
Join discussionApr 18, 2025 · 2 min read · +UB - префиксный класс для +Aux, поддерживающий индекс UB-Tree вместо прямых значений. Это обеспечивает эффективный диапазонный доступ к многомерным данным. Поддерживаются только положительные числовые ключи. (class +Pos +Entity) (rel x (+UB +Aux +Re...
Join discussionFeb 9, 2025 · 4 min read · B Tree là gì B Tree là 1 cấu trúc dữ liệu được sử dụng rất nhiều trong Database, đặc biệt là RDBMS. Nó là 1 cấu trúc dạng cây, do đó nó sẽ có nút gốc (root node), nút lá (leaf node) và các nút trong (internal node). Mỗi nút có 1 cặp key-value k-v B T...
Join discussion
Nov 24, 2024 · 9 min read · What is an index? An index is a - A separate data structure - It is separate from the actual table. A copy of (part of) our data - Whenever we add an index to any column or columns in a table, it copies a part of the data into the index table. Point...
Join discussion
Aug 17, 2024 · 3 min read · Henlo frens We discussed till LSM-tree in the last blog, had to break it down into 2 cause this chapter has too much information. Many databases use B-trees, it has become the standard. LSM-tree and B-tree both keep the key value pair sorted, but bot...
Join discussion
