In database indexing, abranchrefers to thepath from the top-level block (root node) to a bottom-level block (leaf node)in aB-Tree or B+ Tree index structure.
Example Usage in Indexing:
AB-Tree indexorganizes data hierarchically, withbranches leading to different parts of the tree.
When searching for a record, thequery follows a branchfrom theroot node down to the correct leaf node.
Why Other Options Are Incorrect:
Option A (Fan-out) (Incorrect):Refers tohow many children a node has, not the path.
Option B (Crow’s foot) (Incorrect):Anotation used in ER diagrams, not indexing.
Option D (Sparse index) (Incorrect):A type of indexstoring only some entries, not the path itself.
Thus, the correct answer isBranch, as it defines thepath from top to bottom in a database index.
[Reference:SQL Indexing Structures (B-Trees and Index Paths)., ]
Contribute your Thoughts:
Chosen Answer:
This is a voting comment (?). You can switch to a simple comment. It is better to Upvote an existing comment if you don't have anything to add.
Submit