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] Some remarks for SQL

Browse Source
This commit is contained in:
janishutz
2026-08-06 08:21:46 +02:00
parent 101d024733
commit feb8575972
6 changed files with 11 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files
semester4/dmdb/parts/04_query-processing/01_selection/00_intro.tex
+2 -2
View File
@@ -1,7 +1,7 @@
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 \cost{$N \div P_F$},
The options include a \textit{file scan}, where we scan the entire file and thus the I/O cost is \cost{$N \div P_F$},
where $N$ is the number of records in the relation and $P_F$ the number of records per page.
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.
The cost then of course depends on the index used and if said index can even be used to generate the results needed. We will cover that in more detail now.