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 more errors

Browse Source
This commit is contained in:
janishutz
2026-08-15 14:24:25 +02:00
parent 1759b7898c
commit 72378555eb
5 changed files with 4 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
semester4/dmdb/parts/03_systems/02_indexing/06_art-trees.tex
+1 -1
View File
@@ -1,4 +1,4 @@
Adaptive Radix Trees (ARTs) are mainly used to ensure primary key constraints and to speed up point and highly selective queries (selectivity <0.1\%).
Adaptive Radix Trees (ARTs) are mainly used to ensure primary key constraints and to speed up point and highly selective queries (selectivity $<0.1\%$).
It can also be manually created using \texttt{CREATE INDEX} and are automatically created for columns with a \texttt{UNIQUE} or \texttt{PRIMARY KEY} constraint.
The above applies to DuckDB, which is often similar to Postgres.