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)

Related topics

Related topics

50 relations
AA treeAVL treeActian Vector in HadoopB+ tree

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Efficient Mapping of Irregular C++ Applications to Integrated GPUs
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
A Pyramidal Security Model for Large-Scale Group-Oriented Computing in Mobile Ad Hoc Networks: The Key Management Study
In mobile ad hoc networks (MANETs), many applications require group-oriented computing among a large number of nodes in an… 
2009
2009
An efficient XML encoding and labeling method for query processing and updating on dynamic XML data
2008
2008
Optimization of Indices in ODRA
The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database… 
2006
2006
Spatio-temporal data warehouses using an adaptive cell-based approach
2005
2005
Online B-tree merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous… 
2004
2004
Distributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
+ Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic… 
2000
2000
Design and Evaluation of Approaches to Automatic Chinese Text Categorization
In this paper, we propose and evaluate approaches to categorizing Chinese texts, which consist of term extraction, term selection… 
1996
1996
Query Processing Techniques for Multiversion Access Methods
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where… 
1992
1992
Analytical results on the quadtree decomposition of arbitrary rectangles
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)