Match List-I with List-II and select the correct answer using the codes given below the lists:
List-I List-II
A. Primary index 1. Dense
B. Clustered index 2. sparse
C. Secondary key index
D. Secondary non key index.
A B C D
A. | 2 1 1 2 |
B. | I 1 2 1 |
C. | 1 2 2 1 |
D. | 2 2 1 1 |
Option: C Explanation : Click on Discuss to view users comments. majeed said: (4:35pm on Tuesday 23rd September 2014)
ans is d
|
The order of an internal node in a B* tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
A. | 24 |
B. | 25 |
C. | 26 |
D. | 27 |
Option: C Explanation : Click on Discuss to view users comments. sunitha joshi said: (12:39pm on Thursday 4th April 2013)
how is it calculated? any formula plz suggest
|
A clustering index is defined on the fileds which are of type
A. | Non-key and ordering |
B. | Non-key and non-ordering |
C. | Key and ordering |
D. | Key and non-ordering |
Option: A Explanation : Click on Discuss to view users comments. |
Syllabus covered in this section is-
This Section covers Data Warehousing Questions Answers .These questions can be used for the preparation of various competitive and academic exams like
Who can benefit
Various Search Terms used for this section are