physical storage in database | DBMS

DBMS
physical storage media overview

[saibharath]

Explanation is too good but we need some theory for exam mam
Thanq u .

[selometas]

please help me
The relation R (K, A, B, C) consists of NT (R) = 10, 000 tuples stored on NP (R) = 2, 000 pages, while the relation S (H, E, F) consists of NT (S) = 5, 000 stored tuples on NP (S) = 1, 000 pages. We want to calculate the cost of the join R ⋈𝐻 = 𝐶S in the following two cases:
1. A B + -tree with depth h = 3 is defined on the primary key H of S
2. A hash function is defined on the primary key H of S
assuming that the join algorithm exploits the presence of the indexes.