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… (More)
Wikipedia

Related topics

Related topics

50 relations
AA treeAVL treeActian Vector in HadoopB+ tree
(More)

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… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • table I
Is this relevant?
Highly Cited
2008
Highly Cited
2008
A practical scalable distributed B-tree
Internet applications increasingly rely on scalable data structures that must support high throughput and store huge amounts of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The SR-tree: An Index Structure for High-Dimensional Nearest Neighbor Queries
Recently, similarity queries on feature vectors have been widely used to perform content-based retrieval of images. To apply this… (More)
  • figure I
  • figure 2
  • table 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
An asymptotically optimal multiversion B-tree
In a variety of applications, we need to keep track of the development of a data set over time. For maintaining and querying… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
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… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.1
  • figure 6.1
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
Concurrency of operations on B-trees
Concurrent operations on B-trees pose the problem of insuring that each operation can be carried out without interfering with… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
1972
Highly Cited
1972
Symmetric binary B-Trees: Data structure and maintenance algorithms
A class of binary trees is described for maintaining ordered sets of data. Random insertions, deletions, and retrievals of keys… (More)
  • figure 2
  • figure 3
Is this relevant?