eth-janishutz/eth-summaries
1
0
Fork 0
mirror of https://github.com/janishutz/eth-summaries.git synced 2026-07-27 21:29:09 +02:00
Code Issues Packages Projects Releases Wiki Activity

[DMDB] Sorting, selection, projection, aggregation

Browse Source
This commit is contained in:
janishutz
2026-07-17 16:08:58 +02:00
parent 653a807848
commit 89009ef7d3
13 changed files with 161 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
+6
View File
@@ -0,0 +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.
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.