eth-janishutz/eth-summaries
1
0
Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2026-09-10 19:15:25 +02:00
Code Issues Packages Projects Releases Wiki Activity

[DMDB] Fix issue

Browse Source
This commit is contained in:
janishutz
2026-08-15 12:18:07 +02:00
parent aca626feaf
commit 1759b7898c
2 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
semester4/dmdb/data-modelling-databases-summary.pdf
BIN
View File
Binary file not shown.
semester4/dmdb/parts/03_systems/02_indexing/01_b-trees/02_operations.tex
+1 -1
View File
@@ -5,7 +5,7 @@ When we reach a leaf node, we return the corresponding pointer and the position.
\subparagraph{Range Lookup}
We return all tuples that match, by first finding the first tuple matching, the continue traversal until the last match is found.
We return all tuples that match, by first finding the first tuple matching, then continue traversal until the last match is found.
We can determine the last match easily because the tree's leafs are lexicographically sorted.
Since the leafs are linked as linked lists, we can simply move along the linked lists, cutting down on processing time.