1.
Consider the following query :
SELECT E.eno, COUNT(*)
FROM Employees E
GROUP BY E.eno
If an index on eno is available, the query can be answered by scanning only the index if
2.
Which of the following is correct?
3.
In a B+ tree, if the search-key value is 12 bytes long, the block size is 1024 bytes and the block pointer is 6 bytes, then the maximum number of keys that can be accommodated in each non-leaf node of the tree is _____ .
4.
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
5.
In the index allocation scheme of blocks to a file, the maximum possible size of the file depends on :
6.
A clustering index is defined on the fields which are of type
7.
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is 4 bytes in size. Given a 100 x 106 bytes disk on which the file system is stored and data block size is 103 bytes, the maximum size of a file that can be stored on this disk in units of 106 bytes is ____________.
8.
Consider a B+-tree in which the maximum number of keys in a node is 5. What is the minimum number of keys in any non-root node?
9.
An index is clustered, if
10.
An index is clustered, if