PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (198)
Orphanage
Unclass'd
Unproven (498)
Corrections (25)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
B-tree (Definition)

A B-tree of order $ m$ is a balanced search tree in which

  • every node has at most $ m$ children,
  • every node, other than a root or leaf, has at least $ m/2$ children,
  • the root has at least 2 children if it is not a leaf,
  • all leaf nodes appear on the same level
  • a nonleaf node with $ k$ children has $ k-1$ keys.

If the tree has $ n$ nodes its height is $ O(log_2(n))$.



"B-tree" is owned by Mathprof.
(view preamble)

View style:

Also defines:  order
Log in to rate this entry.
(view current ratings)

Cross-references: height, tree, keys, level, leaf, root, children, node, search tree
There are 16 references to this entry.

This is version 6 of B-tree, born on 2007-07-04, modified 2007-07-05.
Object id is 9730, canonical name is BTree.
Accessed 1257 times total.

Classification:
AMS MSC: 68P05 (Computer science :: Theory of data :: Data structures)
 68P10 (Computer science :: Theory of data :: Searching and sorting)
Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)