Benjamin/ObsidianVault
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

vault backup: 2026-07-26 12:20:45

Browse Source
This commit is contained in:
Benjamin Neumann
2026-07-26 12:20:45 +02:00
parent c854b29a58
commit d0203d4af1
3 changed files with 12 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files
SS2026/Datenbanken und Informationssysteme/5. Relationale Anfragebearbeitung/Relationale Anfragebearbeitung.md
+1 -1
View File
@@ -77,7 +77,7 @@ Index Nested Loop Join
Ein B-Baum ist ein selbstbalancierender, geordneter M+1-Wege-Suchbaum
- Ale Blätter auf selber Ebene
- Max M Schlüssel pro Knoten
- Min M/2 Schlüssel
- Min Abgerundet M/2 Schlüssel
- Wurzel Min 1 Schlüssel
- Jeder Knoten mit k Schlüsseln hat k+1 Kinder
![[Pasted image 20260723142759.png]]
SS2026/Klausurplan.canvas
+1 -1
View File
@@ -12,7 +12,7 @@
{"id":"0c3a7d9fc441e6a1","type":"text","text":"21.08 - 27.08","x":-200,"y":-40,"width":140,"height":60,"color":"3"},
{"id":"0ee51e9aebc3d818","type":"text","text":"28.08 - 11.09","x":-200,"y":40,"width":140,"height":60,"color":"3"},
{"id":"3b0c086a17329c0a","type":"text","text":"12.09 - 24.09","x":-200,"y":120,"width":140,"height":60,"color":"3"},
{"id":"bee8484892d1409c","type":"text","text":"","x":0,"y":-280,"width":140,"height":60,"color":"4"},
{"id":"bee8484892d1409c","type":"text","text":"22.07 - 26.07","x":0,"y":-280,"width":140,"height":60,"color":"4"},
{"id":"0a635fdaf64bc22d","type":"text","text":"","x":0,"y":-200,"width":140,"height":60,"color":"4"},
{"id":"d5ded2115fd31993","type":"text","text":"","x":0,"y":-120,"width":140,"height":60,"color":"4"},
{"id":"0ec16c554bfaa7e9","type":"text","text":"","x":0,"y":-40,"width":140,"height":60,"color":"4"},