Characteristics
For a b-order B+ tree with h levels of index:
- The maximum number of records stored is
- The minimum number of records stored is
- The minimum number of keys is
- The space required to store the tree is
- Inserting a record requires operations
- Finding a record requires operations
- Removing a (previously located) record requires operations
- Performing a range query with k elements occurring within the range requires operations
- Performing a pagination query with page size s and page number p requires operations
Read more about this topic: B+ Tree