Databases Test ...

The clustering index is defined on the fields which are of type

Suppose that we have an ordered file with r = 30000 records stored on a disk with block size B = 1024 bytes. If file records are of fixed size and are unspanned with record length R = 100 bytes, the blocking factor for the file and the number of blocks needed for the file are _____ and _____ respectively.

Consider a B+ tree in which the minimum number of keys in a node is 10. What is the maximum number of keys in any non-root node?

In a B-Tree, each node represents a disk block. Suppose one block holds 8192 bytes. Each key uses 32 bytes. In a B-tree of order M there are M – 1 keys. Since each branch is on another disk block. We assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is

Consider the following statements:

S1: Sparse indices can be used only if the relation is stored in sorted order of the search key.

S2: It is generally faster to locate a record if we have a dense index rather than a sparse index.

Which of the above statements is true?

Consider an ordered file of 24000 records on a disk with a block size of 1024 bytes. A primary index is created on the key field of size 8 bytes and a block pointer of size 7 bytes. Find the average number of block accesses to search a record using the index. Records are fixed and unspanned of size 10 bytes.