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.
2013
2013
A Hilbert-based framework for preserving privacy in location-based services
Preserving user's privacy has recently drawn special attention in the field of location-based services and many techniques such… 
2011
2011
A Fast Algorithm for Constructing Inverted Files on Heterogeneous Platforms
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… 
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… 
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
TheSB-tree an index-sequential structure for high-performance sequential access
A variant of aB-tree known as anSB-tree is introduced, with the object of offering high-performance sequential disk access for… 
1992
1992
Analytical results on the quadtree decomposition of arbitrary rectangles
Highly Cited
1985
Highly Cited
1985
Bit Transposed Files
Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file… 
1983
1983
A concurrency control theory for nested transactions (Preliminary Report)
Concurrency control is the activity of synchronizing transactions that access shared data. A concurrency control algorithm is… 
Review
1982
Review
1982
A New Method for Concurrency in B-Trees
In this paper we study the problem of supporting concurrent operations in B-trees and their variants. A survey of previous work… 
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)