(a,b)-tree

Known as: (a,b) tree, A-B-tree, Ab tree

In computer science, an (a,b) tree is a kind of balanced search tree. An (a,b)-tree has all of its leaves at the same depth, and all internal nodes…

Papers overview

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

2014

Big Data boosts the development of data management and analysis in database systems but it also poses a challenge to traditional…

2006

This paper presents a new locally refined collision detection approach for large scale complex meshes in distributed virtual…

2005

With the increasing popularity of XML as a standard for data representation and exchange, efficient XML query processing has…

2004

In a bulk update of a search tree a set of individual updates (insertions or deletions) is brought into the tree as a single…

2000

We present the performance analysis of AB-tree, an efficient indexing scheme for high dimensional databases. AB-tree is based on…

2000

In recent, many image data have been used typically because of computer and communication development. Accordingly, the methods…

1999

Nearest Neighbor search is a fundamental task in many applications. At present state of the art, approaches to nearest neighbor…

1992

A variant of aB-tree known as anSB-tree is introduced, with the object of offering high-performance sequential disk access for…

1989

An augmented binary (AB) tree architecture is proposed with a view to providing fault tolerance. This architecture is an…