Bitmap Indices MCQs with Answers PDF Download – Test 374

MCQ 1866: The Lookup operation incase of any updation on B+ trees is:

1. Complex
2. Inefficient
3. Efficient
4. Easy/plain

MCQ 1867: Files are logically partitioned into storage units of fixed-length known as:

1. Sectors
2. Tracks
3. Segments
4. Blocks

MCQ 1868: It is possible that several distinct sets of attributes could serve as a:

1. Superset key
2. Super key
3. Unique key
4. Candidate key

MCQ 1869: JDBC can create an updatable result set from a query on a database relation that performs a:

1. Selection
2. Projection
3. Both A and B
4. Pattern

MCQ 1870: The clause that provides a way of defining a temporary relation whose definition is available only to the query in which that clause occurs, is said to be:

1. Select clause
2. Group by clause
3. Having clause
4. With clause