DBT: INDEXING

Practice set based on indexing screenshots: bitmap index matching, sparse/dense index sizing, extensible hashing, B/B+ trees, and grid-file/hash-index reasoning.

Progress

0/19

Question 1

1 point(s)

Bitmap index matching (students relation)

Consider relation students(studentID, degree, courseID) with bitmap indexes on degree and courseID:

Bitmap index on degree:
ISM:    010101
CS:     101010

Bitmap index on courseID:
DBT:    101000
DBTLAB: 010010
ROC:    000100
DW:     000001

Option A

studentID	degree	courseID
1	CS	DBT
2	ISM	DBTLAB
3	CS	ROC
4	ISM	DBT
5	ISM	DBTLAB
6	ISM	DW

Option B

studentID	degree	courseID
1	CS	DBT
2	ISM	DBTLAB
3	CS	DW
4	ISM	DBT
5	ISM	DBTLAB
6	ISM	ROC

Option C

studentID	degree	courseID
1	CS	DBT
2	ISM	DBTLAB
3	CS	DBT
4	ISM	ROC
5	CS	DBTLAB
6	ISM	DW

Option D

studentID	degree	courseID
1	CS	DBT
2	ISM	DBTLAB
3	CS	ROC
4	ISM	DBT
5	CS	DBTLAB
6	ISM	DW

Which table matches these bitmap indexes?

Option A

Option B

Option C

Option D