Q. The number of values taken by hash field are called

View solution

Q. The index which has an entry for some of the key value is classified as

View solution

Q. The primary indexes, secondary indexes and cluster indexes are all types of

View solution

Q. In multilevel indexes, the primary index created for its first level is classified as

View solution

Q. The indexes which specifies address of records on disk with a physical pointer are classified as

View solution

Q. The example of non dense index is

View solution

Q. In the data file, the first record of any of the block is called

View solution

Q. The file which has secondary index for its every field is classified as

View solution

Q. The first field in the primary index having same data type as in the ordering field is considered as

View solution

Q. In multilevel indexes, the primary index created for its second level is classified as

View solution

Q. The kind of index which is based on any candidate key or a non key field which may have duplicate values is classified as

View solution

Q. In multilevel indexes, the blocking factor is also called

View solution

Q. The index which has an entry for every key value is classified as

View solution

Q. The special node in the tree structure which has many child nodes and one parent node is called

View solution

Q. The tree structure diagram in which the pointers of data are stored at the leaf nodes of diagram is classified as

View solution

Q. The type of multilevel index which leaves space for inserting new entries in its blocks is called

View solution

Q. In tree structure, the node which is free of child nodes is called

View solution

Q. In physical ordered record files, the non key field for which the records does not have distinct values is classified as

View solution

Q. The search value which is present on each node in search tree diagram of order 'p' is as

View solution

Q. The kind of index in which the records have fixed length with only two fields is classified as

View solution