Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
13 Cards in this Set
- Front
- Back
|
Linear Search |
br * tr + ts Linear Search |
|
|
Linear Search on a key attribute |
br/2 * tr + ts Linear Search on a key attribute |
|
|
Binary Search |
[Log2(br)] * (tr + ts) Binary Search |
|
|
Equally on Primary Key |
(hi + 1) * (tr + ts) Equally on Primary Key |
|
|
Equally on non-Primary Key |
(hi + 1) * (tr+ ts) + ts + (tr * b) Equally on non-Primary Key |
|
|
Equally on second Key of secondary index (can key) |
(hi + 1) * (ts + tr) Equally on second Key of secondary index (can key) |
|
|
Equally on second Key of secondary index (non-can key) |
(hi + n) * (ts + tr) Equally on second Key of secondary index (non-can key) |
|
|
Nested loop join (worse case) |
(nr *bs) + br + (nr + br) Nested loop join (worse case) |
|
|
Nested loop join (best case) |
Br + bs + 2 Nested loop join (best case) |
|
|
Index nested loop join |
(br + nr)*(L+1) L = [logm(ns)] Index nested loop join |
|
|
Block nested loop join (worst case) |
(br * bs) + br + (2 * br) Block nested loop join (worst case) |
|
|
Block nested loop join (best case) |
(br * bs) + br +2 Block nested loop join (best case) |
|
|
Hash Join |
3(*br+bs) Hash Join |
