E CONTENT FOR DATABASE DESIGN DBMS.pptx

DATABASE DESIGN

1. Ÿ
es

Database -

LUS

2. ol 521-8976
John Smith Ly UT
7 521-1234
ol 1
E
© SE
14 521-9655
sl |

3. Mnlii-level Sands
Index :

Single level index

4. p Tree Ws
pr Tree

5. + AB*tree can be viewed as a B-tree in which each node Following 53 typical tree
contains only keys (not pairs), and to which an additional level
is added at the bottom with linked leaves

Bine,

geler ds
du card

6. —
ve

ROW SOURCE GENERATION

Fig. Query Processing ECUTION ENGINE

7. Query Planning
Concurrency Control
Operator Execution

Access Methods
Recovery

Buffer Pool Manager

Disk Manager

Concurrency Control and
Recovery

ss the database concurrently, and
stems cr
+ Concurrent access to the database also improves performance,
yields better utilization of resources.

+ In real life:

reful, concurrent à s can lead to incorrect database
states. Crashes can also leave the database in incoherent state:

» Basic concurrency/recovery concept: transaction
“e ted atomically. All or nothin:

nsactions in SQL
plementation of transactions and recovery.