|
CSE-4411M
Database Management Systems
York University
Winter 2014
|
Test #1: Preparation
|
|
|
|
Probably
five questions.
- 1 or 2 exercise
- E.g., What would this linear hash look like after the addition
of a record with key 27 is added?
- 1 or 2 short answer
- E.g., Which of the following indexes would be most appropriate
for use with this query? Why?
- 1 or 2 analysis
- E.g., Consider a buffer pool
that accommodates variable size pages...
What would be the performance issues?
|
|
|
|
Basically
chapters 8–11, & 13 from the textbook.
We have covered the first third of the course,
the physical database.
Only topics covered in the reading and in class are fair game.
- Storage & Indexing (Ch.8 & 9)
- disk space manager
- cost model: how to count I/O's
- buffer pool manager
- types of indexes
- clustered vs. unclustered
- alternatives 1, 2, &3 arrangements
- matching to search keys
- differences between tree and hash-based indexes for useage
- file and page organization
- Tree Indexes (Ch.10)
- B+ Trees
- mechanics
- balance rules
- design choices
- optimization issues, like prefix key compression
- Hash-based Indexes (Ch.11)
- extendable
- linear
- External Sorting (Ch.13)
- What are the issues for sorting externally?
- the basic algorithm
- variations to improve performance (e.g., tournament sort)
- I/O-boundedness & CPU-boundedness
|
|
|
|
The
test will be closed-note, closed-book.
You may bring a calculator,
but the test will be designed so that any math
shouldn't need one.
There will be space on the text packet for writing answers.
I will bring extra paper, in case anyone needs it,
to attach.
The test will be for the class lecture time,
so 75 minutes.
|
|
|
Parke Godfrey
|
|
|