Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 233,238,897 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
Review
2011
Review
2011
Design and evaluation of a hierarchical application placement algorithm in large scale clouds
Hendrik Moens
,
J. Famaey
,
Steven Latré
,
B. Dhoedt
,
F. Turck
IFIP/IEEE Symposium on Integrated Network…
2011
Corpus ID: 18994393
As the requirements and scale of cloud environments increase, scalable management of the cloud is needed. Centralized solutions…
Expand
2011
2011
Efficient association rule mining using indexing support
V. Rao
International Conference on Recent Trends in…
2011
Corpus ID: 16308160
This paper presents the Btree index, a general and compact structure which provides tight integration of item set extraction in a…
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
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
2000
2000
A Fast Convergence Technique for Online Heat-Balancing of Btree Indexed Database over Shared-Nothing Parallel Systems
Hisham Feelifl
,
M. Kitsuregawa
,
B. Ooi
International Conference on Database and Expert…
2000
Corpus ID: 16495036
In shared-nothing environments, data is typically declustered and indexed across the system processing elements (PEs) to achieve…
Expand
2000
2000
Design and Evaluation of Approaches to Automatic Chinese Text Categorization
Jyh-Jong Tsay
,
Jing-Doo Wang
ROCLING/IJCLCLP
2000
Corpus ID: 1007975
In this paper, we propose and evaluate approaches to categorizing Chinese texts, which consist of term extraction, term selection…
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
1994
1994
Image segmentation using globally optimal growth in three dimensions with an adaptive feature set
David C. Taylor
,
W. Barrett
Other Conferences
1994
Corpus ID: 52075416
A globally optimal region growing algorithm for 3D segmentation of anatomical objects is developed. The notion of simple 3D…
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