File structures (sequential files, indexing, B and B+ trees) (original) (raw)

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?

Database applications were built directly on top of file system to overcome the following drawbacks of using file-systems: (i) Data redundancy and inconsistency (ii) Difficulty in accessing Data (iii) Data isolation (iv) Integrity problems

In __________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.

The directory can be viewed as ________ that translates filenames into their directory entries

Which of the following is dense index?

Database systems that store each relation in a separate operating system file may use the operating system’s authorization scheme, instead of defining a special scheme themselves. In this case, which of the following is false?

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

The level of aggregation of information required for operational control is

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 RollNo. The size of a record pointer for this disk is 7 bytes. Each student-record has a candidate key attribute called ANum of size 12 bytes. Suppose an index file with records consisting of two fields, ANum value and the record pointer the corresponding student record, is built and stored on the same disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ________ .

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:

There are 36 questions to complete.

Take a part in the ongoing discussion