Why Modern Databases Use LSM Trees Instead of B-Trees
Jan 16 · 3 min read · Traditional databases like MySQL and PostgreSQL use B-trees as their primary storage structure. B-trees modify data in place on disk, which means updates can happen at many different disk locations. This leads to random disk writes, which are expensi...
Join discussionubIter ... +UB
Apr 18, 2025 · 2 min read · +UB - префиксный класс для +Aux, поддерживающий индекс UB-Tree вместо прямых значений. Это обеспечивает эффективный диапазонный доступ к многомерным данным. Поддерживаются только положительные числовые ключи. (class +Pos +Entity) (rel x (+UB +Aux +Re...
Join discussionB+Tree in DBMS
Jun 30, 2023 · 12 min read · Introduction In this article, we will explore B+ Trees, a fundamental data structure extensively utilized in DBMS, especially for table indexes. Building upon our previous discussion of Hash Tables, we will delve into the design considerations, imple...
Join discussion
Exploring Multi-Way Search Trees: A Comprehensive Overview
Jul 3, 2020 · 3 min read · The data structure that is used in database A M-way search tree has similar concept of that of binary tree and has M-1 values per nodes and M-sub trees. In this type of tree, M is called the degree of the tree. Fig.1. Structure of M-Way Search Tree ...
Join discussion