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.
2016
2016
A Neural Architecture Mimicking Humans End-to-End for Natural Language Inference
In this work we use the recent advances in representation learning to propose a neural architecture for the problem of natural… 
Review
2011
Review
2011
Design and evaluation of a hierarchical application placement algorithm in large scale clouds
As the requirements and scale of cloud environments increase, scalable management of the cloud is needed. Centralized solutions… 
2008
2008
Optimization of Indices in ODRA
The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database… 
2006
2006
Semantic and Structure Based XML Similarity: An Integrated Approach
Since the last decade, XML has gained growing importance as a major means for information management, and has become inevitable… 
2006
2006
Dynamic Rank/Select Dictionaries with Applications to XML Indexing
We consider a central problem in text indexing: Given a text T over an alphabet (cid:6), construct a compressed data structure… 
2005
2005
Efficiently Processing Queries on Interval-and-Value Tuples in Relational Databases
With the increasing occurrence of temporal and spatial data in present-day database applications, the interval data type is… 
2000
2000
Design and Evaluation of Approaches to Automatic Chinese Text Categorization
In this paper, we propose and evaluate approaches to categorizing Chinese texts, which consist of term extraction, term selection… 
1998
1998
Local Cascade Generalization
In a previous work we have presented Cascade Generalization, a new general method for merging classiiers. The basic idea of… 
1998
1998
Efficient Search of Multidimensional B-Trees
Data in relational databases is frequently stored and retrieved using B-Trees. In &cis,ion isugprt applications the key of the B… 
1981
1981
A robust B-tree implementation
A storage structure for B-trees is presented which is robust in that any pair of changes to structural fields of an instance of… 
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)