Which of the following is an example of multilevel indexing
Which of the following is an example of multilevel indexing ?
AA-tree
BB-tree
CDictionary
DNetwork.
All DiscussionsClick here to write answer
Answer : B-tree
Explanation:
A B-tree is a method of placing and locating files (called records or keys) in a database. (The meaning of the letter B has not been explicitly defined.) The B-tree algorithm minimizes the number of times a medium must be accessed to locate a desired record, thereby speeding up the process.
Reference: http://searchsqlserver.techtarget.com/definition/B-tree
All Comments
Post your answers here:
Post