QuizzesAdvanced Database Indexing Strategies: B-Trees and Beyond
advanced
databases

Advanced Database Indexing Strategies: B-Trees and Beyond

Explore advanced concepts and strategies in database indexing, focusing on B-Trees and beyond.

20 minutes 10 questions Pass at 70%
Time Limit
20 minutes - timer starts when you begin
Change Answers Freely
Revisit and change any answer before submitting
Full Review After Submit
Correct answers and explanations shown for every question
Auto-submit on timeout
Quiz submits automatically when time runs out

Questions in this quiz

10 questions on Advanced Database Indexing Strategies: B-Trees and Beyond. Work through them here, then start the quiz to answer them and see your score.

  1. 1.What is the primary advantage of using a B+ Tree over a B-Tree in database indexing?

    • AB+ Trees require less memory for internal nodes.
    • BB+ Trees have a higher branching factor.
    • CB+ Trees store all data in leaf nodes, improving range queries.
    • DB+ Trees are faster for single key lookups.
  2. 2.In a B-Tree, what is the effect of increasing the order of the tree?

    • AIncreases the number of leaf nodes.
    • BIncreases the height of the tree.
    • CDecreases the height of the tree.
    • DDecreases the number of keys per node.
  3. 3.How does a B-Tree handle node splits during insertion?

    • AMerges with a sibling node.
    • BRedistributes keys among sibling nodes.
    • CSplits the node and promotes the middle key to the parent.
    • DCreates a new root node.
  4. 4.Which of the following is a key characteristic of an LSM Tree compared to a B-Tree?

    • ALSM Trees store all data in internal nodes.
    • BLSM Trees are optimized for read-heavy workloads.
    • CLSM Trees use a write-optimized approach with sequential writes.
    • DLSM Trees have a fixed height.
  5. 5.What is a potential drawback of using hash indexes compared to B-Trees?

    • AHash indexes have slower point lookups.
    • BHash indexes require more memory.
    • CHash indexes do not support range queries.
    • DHash indexes are more complex to implement.
  6. 6.Why might a database choose to use a GiST index over a B-Tree?

    • AGiST indexes support more complex data types and queries.
    • BGiST indexes are easier to maintain.
    • CGiST indexes require less disk space.
    • DGiST indexes are faster for point queries.
  7. 7.How does a B-Tree ensure balance during deletions?

    • ABy merging nodes and redistributing keys.
    • BBy promoting keys from leaf nodes.
    • CBy increasing the order of the tree.
    • DBy creating new nodes.
  8. 8.What is a key advantage of using a clustered index in a database?

    • AClustered indexes improve insert performance.
    • BClustered indexes reduce disk space usage.
    • CClustered indexes are faster for updates.
    • DClustered indexes store data rows in order, improving range queries.
  9. 9.In what scenario might a database prefer a bitmap index over a B-Tree index?

    • AWhen the table requires frequent range queries.
    • BWhen the table has low cardinality and is read-heavy.
    • CWhen the table has a high cardinality.
    • DWhen the table is frequently updated.
  10. 10.What is the main reason for using a full-text index in a database?

    • ATo improve the performance of exact match queries.
    • BTo reduce the size of the database.
    • CTo optimize the database for transactional workloads.
    • DTo enable efficient text search capabilities.