B+ tree

GPTKB entity

Statements (50)
Predicate Object
gptkbp:instanceOf gptkb:architecture
gptkbp:advantage efficient range queries
minimizes disk reads
gptkbp:application transaction processing
file organization
key-value stores
indexing large datasets
gptkbp:hasProperty all leaves at same depth
all values at leaf level
balanced height
efficient for block-oriented storage
fanout greater than 2
high fan-out reduces tree height
internal nodes guide search
internal nodes store keys only
leaves linked for fast traversal
leaves store actual records or pointers
minimizes tree height
nodes correspond to disk blocks
nodes have variable number of children
optimized for disk access
splits and merges on insert/delete
supports range scans
used for primary indexes
used for secondary indexes
https://www.w3.org/2000/01/rdf-schema#label B+ tree
gptkbp:introducedIn 1972
gptkbp:inventedBy gptkb:Rudolf_Bayer
gptkbp:isA search tree
self-balancing tree
generalization of B-tree
gptkbp:operator delete
insert
search
sequential access
gptkbp:relatedTo gptkb:red-black_tree
AVL tree
B-tree
binary search tree
gptkbp:usedBy gptkb:MySQL
gptkb:Oracle_Database
gptkb:Microsoft_SQL_Server
gptkb:NTFS
gptkb:PostgreSQL
gptkb:ReFS
gptkbp:usedIn file systems
database systems
gptkbp:bfsParent gptkb:ISAM
gptkb:HPFS
gptkbp:bfsLayer 7