2. Indexing Flashcards

1
Q

Clustered indexes indicate the ___ of the file

Nonclustered indexes indicate ___ of the file

A

Sequential order

An order diferent from the sequential order

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Dense index appears for ___ in the file

Sparse Index appears for ___ in the file

A

Every search-key value

Only some search-key values

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Multilevel index happens when we have ___

A

Indexes on top of indexes (Ex: sparse index on top of desense index)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Multiple-key Indices can be queried on ___ or ___

A

Just one key

Multiple keys

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

On a B+-Tree, all paths from root to leaf are ___

A

Of the same lenght

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

A B+-Tree node structure has interleaved ___ and ___ where these are sorted in ___ ordered

A

Pointers to children

Search-Key Values

Ascending

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

B+-Tree Insertion:

1- Find ___ in which the ___ would appear

2- Insert if ___ or otherwise ___ the nodes and propagate updates to parent nodes

A

Leaf Node

Search-Key value

There is room

Split

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

B+-Tree Deletion:

1- Find ___ in which the ___ would appear

2- Delete (___) from the leaf node

3- If the resulting node has too few entries, and the entries in the node and sibling fit into a single node then ___, otherwise ___

A

Leaf Node

Search-Key value

(Pr, Kr)

Merge siblings

Redistribute pointers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

In a hash index, buckets store ___

A

Entries with pointers to records

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Hash function is used to ___ entries for ___, ___ as well as ___

A

Locate

Acess

Insertion

Deletion

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Bucket overflow can occur because of:

  • ____ buckets
  • ____ in distribution of ___
A

Insuficcient

Skew

Records

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

One form of dynamic hashing is ____ hashing

A

Extendable

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

___MORE ABOUT EXTENDABLE HASHING___

A

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Bitmap indices are a special type of index designed for ___ on ___. • A bitmap is simply an array of ___

A

Efficient querying

Multiple keys

Bits

How well did you know this?
1
Not at all
2
3
4
5
Perfectly