File Structures and Indexing · Database Management System · GATE CSE

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?

In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?

A data file consisting of 1,50,000 student-records is stored on a hard disk with block size of 4096 bytes. The data file is sorted on the primary key ...

Consider a linear list based implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the...

Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? ...

B+ Trees are considered BALANCED because

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 cal...

With reference to the B+ tree index of order 1 shown below, the minimum number of nodes (including the Root node) that must be fetched in order to sat...

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?

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

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum...

B+-trees are preferred to binary trees in databases because

Which of the following is correct?

There are five records in a database. .tg {border-collapse:collapse;border-spacing:0;} .tg td{font-family:Arial, sans-serif;font-size:14px;padding:1...

Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which th...

Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in...

Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of 4 KB. The size of search key is 12 by...

Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes lo...

The following key values are inserted into a B+-tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given...

Consider a file of 16384 records. Each record is 32 bytes long and its key field is of size 6 bytes. The file is ordered on a non-key field, and the f...

Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. Now the key K 50 is deleted from the B+ tree resu...

Consider the B+ tree in the adjoining figure, where each node has at most two keys and three links. Keys K 15 and then K 25 are inserted into this tr...

The order of a leaf node in a B+- tree is the maximum number of (value, data record pointer) pairs it can hold. Given that the block size is 1K bytes,...

Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum n...

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...

A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are o...