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

Last Updated :
Discuss
Comments

Question 1

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?

  • 1

  • 2

  • 3

  • 4

Discuss it

Question 2

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

  • (i)
  • (i) and (iv)
  • (i), (ii) and (iii)
  • (i), (ii), (iii) and (iv)
Discuss it

Question 3

In __________ allocation method for disk block allocation in a file system, insertion and deletion of blocks in a file is easy.
  • Index
  • Linked
  • Contiguous
  • Bit Map
Discuss it

Question 4

The directory can be viewed as ________ that translates filenames into their directory entries
  • Symbol table
  • Partition
  • Swap space
  • Cache
Discuss it

Question 5

Which of the following is dense index?

  • Primary index

  • Clusters index

  • Secondary index

  • Secondary non key index

Discuss it

Question 6

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?
  • The administrator enjoys more control on the grant option
  • It is difficult to differentiate among the update, delete and insert authorizations.
  • Cannot store more than one relation in a file.
  • Operations on the database are speeded up as the authorization procedure is carried out at the operating system level.
Discuss it

Question 7

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

  • non-key and ordering

  • non-key and non-ordering

  • key and ordering

  • key and non-ordering

Discuss it

Question 8

The level of aggregation of information required for operational control is

  • Detailed

  • Aggregate

  • Qualitative

  • None of the above

Discuss it

Question 9

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

  • 698

  • 898

  • 899

  • 4096

Discuss it

Question 10

In the indexed scheme of blocks to a file, the maximum possible size of the file depends on:
  • The number of blocks used for index and the size of index
  • Size of Blocks and size of Address
  • Size of index
  • Size of Block
Discuss it

There are 36 questions to complete.

Take a part in the ongoing discussion
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy