the efficiency of B+ Tree search
tags: learning
content
The efficiency of B+ Tree search is
logF (N)- F: fanout
- N: number of records
In practice:
- the fanout is usually very high
- the height of the tree is usually 3 or 4
tags: learning
The efficiency of B+ Tree search is
logF (N)In practice: