Skip to search formSkip to main contentSkip to account menu

B-tree

Known as: BTree, B-star tree, B*-tree 
In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
There is growing interest in using GPUs to accelerate general-purpose computation since they offer the potential of massive… 
Highly Cited
2009
Highly Cited
2009
In mobile ad hoc networks (MANETs), many applications require group-oriented computing among a large number of nodes in an… 
2008
2008
The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database… 
2005
2005
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous… 
2004
2004
+ Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic… 
1996
1996
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where… 
1992
1992
A variant of aB-tree known as anSB-tree is introduced, with the object of offering high-performance sequential disk access for… 
Highly Cited
1985
Highly Cited
1985
Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file…