eth/eth-summaries
1
0 Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2026-10-08 23:46:20 +02:00
Code Issues Packages Projects Releases Wiki Activity

[DMDB] Fix issues, improve query processing with notes on time complexities

Browse Source
This commit is contained in:
janishutz committed 2026-07-27 14:41:27 +02:00
1 parent d197d01f24
commit be2e079959
22 files changed
+142 -34
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

semester4/dmdb/parts/04_query-processing/01_selection/00_intro.tex
+1 -1
View File
@@ -1,6 +1,6 @@
Two terms important here are \textit{logical selection}, which describes \bi{what} we want to select and \textit{physical selection},
which describes \bi{how} the algorithm or procedure works that actually retrieves, or filters, the data.
The options include an \textit{file scan}, where we scan the entire file and thus the I/O cost is the number of pages in each relation.
The options include an \textit{file scan}, where we scan the entire file and thus the I/O cost is \cost{$N$}, where $N$ is the number of pages in each relation.
Alternatively, we can use \textit{index scan}, where we use an index to retrieve the matching rows.
The cost then of course depends on the index used and if said index can even be used to generate the resulsts needed. We will cover that in more detail now.