Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 238,167,040 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.
2018
2018
Power models, energy models and libraries for energy-efficient concurrent data structures and algorithms
P. Ha
,
V. Tran
,
+5 authors
Ivan Walulya
arXiv.org
2018
Corpus ID: 39271352
This deliverable reports the results of the power models, energy models and libraries for energy-efficient concurrent data…
Expand
2016
2016
Central limit theorem analogues for multicolour urn models
Noela Muller
2016
Corpus ID: 119644639
Consider a (generalised) Pólya urn scheme with q ∈ N, q ≥ 2, different colours that evolves in discrete time. At time zero, the…
Expand
2013
2013
Simulation-based fault propagation analysis of process industry using process variable interaction analysis
A. Hosseini
2013
Corpus ID: 117331336
2010
2010
Efficient physical operators for cost-based XPath execution
H. Georgiadis
,
M. Charalambides
,
V. Vassalos
International Conference on Extending Database…
2010
Corpus ID: 15624526
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML…
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
2008
2008
An Adequate Design for Large Data Warehouse Systems: Bitmap index versus B-tree index
Morteza Zaker
,
S. Phon-Amnuaisuk
,
S. Haw
2008
Corpus ID: 11876982
Although creating indexes on database is usually regarded as a common issue, it plays a key role in the query performance…
Expand
2006
2006
Dynamic Rank/Select Dictionaries with Applications to XML Indexing
Ankur Gupta
,
Wing-Kai Hon
,
R. Shah
,
J. Vitter
2006
Corpus ID: 2658444
We consider a central problem in text indexing: Given a text T over an alphabet (cid:6), construct a compressed data structure…
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
1997
1997
UB-Trees and UB-Cache A new Processing Paradigm for Database Systems
R. Bayer
1997
Corpus ID: 43934188
In this paper we describe a special caching technique, called UB-Cache, which is tailored to work with data organized as a UB…
Expand
1996
1996
Design, verification, and validation of self-checking software components
S. Geoghegan
,
D. Avresky
Conference Proceedings of the IEEE Fifteenth…
1996
Corpus ID: 14403778
We propose a formal approach for adding fault detection to software. An assertion-based formalism is used to represent…
Expand