yadunut/nus
1
0
Fork 0
Code Issues Pull Requests Actions Projects Releases Wiki Activity

fix

Browse Source
This commit is contained in:
Yadunand Prem
2025-10-07 01:03:09 +08:00
parent e74199a38c
commit edffa97c2a
2 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

BIN
cs3223/cheatsheet.pdf
View File

Binary file not shown.

2
cs3223/cheatsheet.typ
View File

@@ -284,7 +284,7 @@ Cost of index scan = $nin + #nle + nlo$
- #nso does'nt incldue write IO for final merging pass as RID is used for lookup
- *#nle*: Leaf pages scanned for evaluating $sigma_p (R)$
- $nle = ceil((||sigma_p_p (R)||)/b_d)$ if clustered
- $nle = ceil((||sigma_p_p (R)||)/b_d)$ if unclustered
- $nle = ceil((||sigma_p_p (R)||)/b_i)$ if unclustered
- *Index Combination*
- Cost = $nin^p + nle^p + nin^q + nle^q + nco + nlo$
- #nco: IO cost to compute join of $pi_p$ $pi_q$