Scribd
Upload
9 views12 pages

25 Finalreview

Uploaded by

m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views12 pages

25 Finalreview

Uploaded by

m
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

25 2 Final Review

26

LM
Intro to Database Systems Lin Ma
15-445/15-645 Computer Science Carnegie
Fall 2021 Mellon University
2

ADMINISTRIVIA

Homework #5: Due Thursday Dec 2nd @


11:59pm.

Project #4: Due Sunday Dec 5th @ 11:59pm.


Additional office hours on Saturday Dec 4th @
3:00pm.

Final Exam: Friday Dec 10th @ 8:30am at


Doherty Hall 2210. Bring pencil and rubber.
15-445/645 (Fall 2021)
3

FINAL EXAM

Exam focuses on topics after mid-term. But


questions may need understanding of earlier
lecture material.

Open book/notes/calculator.

We will post announcements on Piazza with


practice exam.

15-445/645 (Fall 2021)


4

C O U R S E E VA L S

Your feedback is strongly needed:


→ https://cmu.smartevals.com
→ https://www.ugrad.cs.cmu.edu/ta/F21/feedback/

Things that we want feedback on:


→ Homework Assignments
→ Projects
→ Reading Materials
→ Lectures

15-445/645 (Fall 2021)


5

STUFF BEFORE MID-TERM

SQL
Buffer Pool Management
Hash Tables
B+Trees
Storage Models
Inter-Query Parallelism

15-445/645 (Fall 2021)


6

Q U E R Y O P T I M I Z AT I O N

Heuristics
→ Predicate Pushdown
→ Projection Pushdown
→ Nested Sub-Queries: Rewrite and Decompose

Statistics
→ Cardinality Estimation
→ Histograms

Cost-based search
15-445/645 (Fall 2021)
7

TRANSACTIONS

ACID
Conflict Serializability:
→ How to check?
→ How to ensure?
View Serializability
Recoverable Schedules
Isolation Levels / Anomalies

15-445/645 (Fall 2021)


8

TRANSACTIONS

Two-Phase Locking
→ Rigorous vs. Non-Rigorous
→ Deadlock Detection & Prevention

Multiple Granularity Locking


→ Intention Locks

15-445/645 (Fall 2021)


9

TRANSACTIONS

Timestamp Ordering Concurrency Control


→ Thomas Write Rule
Optimistic Concurrency Control
→ Read Phase
→ Validation Phase
→ Write Phase
Multi-Version Concurrency Control
→ Version Storage / Ordering
→ Garbage Collection

15-445/645 (Fall 2021)


10

CRASH RECOVERY

Buffer Pool Policies:


→ STEAL vs. NO-STEAL
→ FORCE vs. NO-FORCE
Write-Ahead Logging
Logging Schemes
Checkpoints
ARIES Recovery
→ Log Sequence Numbers
→ CLRs
15-445/645 (Fall 2021)
11

D I S T R I B U T E D D ATA B A S E S

System Architectures
Replication
Partitioning Schemes
Two-Phase Commit

15-445/645 (Fall 2021)


12

FINAL COMMENTS

Know your goal, constraints, and resources


→ Focus on “high pole in the tent”
→ Keep remind yourself and re-evaluate

Avoid pre-mature optimization/engineering for


non-exist requirements
→ Prefer simple solutions

Avoid cutting corners


→ Balance engineering effort and extensibility
15-445/645 (Fall 2021)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy