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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

In this work we use the recent advances in representation learning to propose a neural architecture for the problem of natural…

2016

Consider a (generalised) Pólya urn scheme with q ∈ N, q ≥ 2, different colours that evolves in discrete time. At time zero, the…

2008

The paper presents the features and samples of use of the optimization by indices module implemented in the ODRA (Object Database…

2006

We consider a central problem in text indexing: Given a text T over an alphabet (cid:6), construct a compressed data structure…

2000

In this paper, we propose and evaluate approaches to categorizing Chinese texts, which consist of term extraction, term selection…

1999

Database management systems (DBMS) achieve high availability and fault tolerance usually by replication. However fault tolerance…

1998

In a previous work we have presented Cascade Generalization, a new general method for merging classiiers. The basic idea of…

1998

Data in relational databases is frequently stored and retrieved using B-Trees. In &cis,ion isugprt applications the key of the B…

1996

We propose a formal approach for adding fault detection to software. An assertion-based formalism is used to represent…

1981

A storage structure for B-trees is presented which is robust in that any pair of changes to structural fields of an instance of…