kristoferssolo/Databases-II-Cheatsheet
1
0
Fork 0
mirror of https://github.com/kristoferssolo/Databases-II-Cheatsheet.git synced 2025-10-21 18:20:35 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

fix seeks

Browse Source
This commit is contained in:
jorenchik 2024-05-06 22:59:26 +03:00
parent 5f19876f7a
commit 226bf240d6
1 changed files with 3 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
main.typ
View File

@ -90,8 +90,9 @@ for each tuple tr in r: (for each tuple ts in s: test pair (tr, ts))
```
Block transfer cost: $n_r ∗ b_s + b_r$ block transfers would be required,
where $b_r$ -- blocks in relation $r$, same for $s$. Seek count depends
on how many buffers are available.
where $b_r$ -- blocks in relation $r$, same for $s$. Each scan of the inner
relation requires one seek, and the scan of the outer relation requires one
seek per block, leading to a total of $2 ∗b_r$ seeks.
== Block-nested join