Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,360,313 papers from all fields of science
Search
Sign In
Create Free Account
B-tree
Known as:
BTree
, B-star tree
, B*-tree
Expand
In computer science, a B-tree is a self-balancing tree data structure that keeps data sorted and allows searches, sequential access, insertions, and…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
AA tree
AVL tree
Actian Vector in Hadoop
B+ tree
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Efficient Mapping of Irregular C++ Applications to Integrated GPUs
R. Barik
,
R. Kaleem
,
+5 authors
Ali-Reza Adl-Tabatabai
IEEE/ACM International Symposium on Code…
2014
Corpus ID: 16779922
There is growing interest in using GPUs to accelerate general-purpose computation since they offer the potential of massive…
Expand
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
B. Rong
,
Hsiao-Hwa Chen
,
Y. Qian
,
K. Lu
,
R. Hu
,
S. Guizani
IEEE Transactions on Vehicular Technology
2009
Corpus ID: 11345181
In mobile ad hoc networks (MANETs), many applications require group-oriented computing among a large number of nodes in an…
Expand
2009
2009
An efficient XML encoding and labeling method for query processing and updating on dynamic XML data
Jun-Ki Min
,
Jihyun Lee
,
C. Chung
Journal of Systems and Software
2009
Corpus ID: 1880897
2008
2008
Optimization of Indices in ODRA
T. Kowalski
,
J. Wislicki
,
K. Kuliberda
,
R. Adamus
,
K. Subieta
International Conference on Objects and Databases
2008
Corpus ID: 5055146
The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database…
Expand
2005
2005
Online B-tree merging
Xiaowei Sun
,
Rui Wang
,
B. Salzberg
,
Chendong Zou
ACM SIGMOD Conference
2005
Corpus ID: 577411
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous…
Expand
2004
2004
Distributed Fault-Tolerant Embedding of Several Topologies in Hypercubes
Shih-Chang Wang
,
Yuh-Rong Leu
,
S. Kuo
Journal of information science and engineering
2004
Corpus ID: 6939704
+ Embedding is of great importance in the applications of parallel computing. Every parallel application has its intrinsic…
Expand
1996
1996
Query Processing Techniques for Multiversion Access Methods
Jochen Van den Bercken
,
B. Seeger
Very Large Data Bases Conference
1996
Corpus ID: 15905051
Multiversion access methods have been emerged in the literature primarily to support queries on a transaction-time database where…
Expand
1992
1992
TheSB-tree an index-sequential structure for high-performance sequential access
P. O'Neil
Acta Informatica
1992
Corpus ID: 14338648
A variant of aB-tree known as anSB-tree is introduced, with the object of offering high-performance sequential disk access for…
Expand
1992
1992
Analytical results on the quadtree decomposition of arbitrary rectangles
C. Faloutsos
Pattern Recognition Letters
1992
Corpus ID: 36002737
Highly Cited
1985
Highly Cited
1985
Bit Transposed Files
H. Wong
,
Hsiu-Fen Liu
,
F. Olken
,
D. Rotem
,
Linda Wong
Very Large Data Bases Conference
1985
Corpus ID: 14978513
Conventional access methods cannot be effectively used in large Scientific/Statistical Database (SSDB) applications. A file…
Expand
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)
ACCEPT & CONTINUE