Skip to search formSkip to main contentSkip to account menu

B+ tree

Known as: Quaternary Tree, B+-tree, B plus tree 
A B+ tree is an n-ary tree with a variable but often large number of children per node. A B+ tree consists of a root, internal nodes and leaves. The… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Erratum: Ming-Dong Zhu, De-Rong Shen, Yue Kou, Tie-Zheng Nie, Ge Yu. A Framework for Supporting Tree-Like Indexes on the Chord… 
2012
2012
The paper addresses the problem of face recognition for images with lighting problems - flashes, shadows and very low brightness… 
2008
2008
On large computational grids, performance is one of the main problems that has to be addressed but another important issue is the… 
2006
2006
We consider a central problem in text indexing: Given a text T over an alphabet (cid:6), construct a compressed data structure… 
2004
2004
Two areas in intrusion detection research receive little attention: data collection and data management. Gigabit Ethernet is… 
1997
1997
We consider a variant of B/sup +/-tree called the B/sup +/-tree with physical clustering (BC), which is exemplified by VSAM key… 
1995
1995
A boron doped epilayer was used to investigate the interaction between end of range dislocation loops (formed from Ge… 
1975
1975
Ten-year old Elaine with 23 consecutive errorless end-of-the-week spelling tests wrote in an independent writing assignment, "The…