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

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.
Highly Cited
2013
Highly Cited
2013
The Bw-Tree: A B-tree for new hardware platforms
The emergence of new hardware and platforms has led to reconsideration of how data management systems are designed. However… 
Highly Cited
2013
Highly Cited
2013
BTRFS: The Linux B-Tree Filesystem
BTRFS is a Linux filesystem that has been adopted as the default filesystem in some popular versions of Linux. It is based on… 
Review
2011
Review
2011
Modern B-tree techniques
  • G. Graefe, H. Kuno
  • IEEE 27th International Conference on Data…
  • 2011
  • Corpus ID: 14871717
In summary, the core design of B-trees has remained unchanged in 40 years: balanced trees, pages or other units of I/O as nodes… 
Highly Cited
2009
Highly Cited
2009
The log-structured merge-tree (LSM-tree)
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… 
Highly Cited
2004
Highly Cited
2004
Symmetric binary B-Trees: Data structure and maintenance algorithms
  • R. Bayer
  • Acta Informatica
  • 2004
  • Corpus ID: 28836825
SummaryA class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of… 
Highly Cited
1996
Highly Cited
1996
An asymptotically optimal multiversion B-tree
Abstract.In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and… 
Highly Cited
1981
Highly Cited
1981
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
The problem of retrieving multikey records via range queries from a large, dynamic index is considered. By large it is meant that… 
Highly Cited
1981
Highly Cited
1981
Efficient locking for concurrent operations on B-trees
The B-tree and its variants have been found to be highly useful (both theoretically and in practice) for storing large amounts of… 
Review
1979
Review
1979
Ubiquitous B-Tree
B-trees have become, de facto, a standard for file organization. File indexes of users, dedicated database systems, and general… 
Highly Cited
1977
Highly Cited
1977
Prefix B-trees
Two modifications of <italic>B</italic>-trees are described, simple prefix <italic>B</italic>-trees and prefix <italic>B</italic… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License