bitmap indices

mcqspedia.com has 5 Question/Answers about Topic bitmap indices

A tree in which every distance from root of tree to a leaf of tree is of same length is called

A tree in which every distance from root of tree to a leaf of tree is of same length is called
  • A. Unbalanced tree
  • B. Balanced tree
  • C. Structured tree
  • D. Unstructured tree
  • Correct Answer: Option B

B+ trees are used for indexing a file containing records and

B+ trees are used for indexing a file containing records and
  • A. Organizing files
  • B. Organizing records in a file
  • C. Organizing structure
  • D. Organizing sequences
  • Correct Answer: Option B

A B+ tree index takes form of a

A B+ tree index takes form of a
  • A. Complex tree
  • B. Simple tree
  • C. Balanced tree
  • D. Unbalanced tree
  • Correct Answer: Option C

For locating data, sequential file organizations require an

For locating data, sequential file organizations require an
  • A. Random structure
  • B. Uniform location
  • C. Index structure
  • D. Sequenced structure
  • Correct Answer: Option C

B-tree eliminates redundant storage of

B-tree eliminates redundant storage of
  • A. Search keys
  • B. Indices
  • C. Buckets
  • D. Bucket skew
  • Correct Answer: Option A