Skip to search formSkip to main contentSkip to account menu

(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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
2–3 treeB-treeComputer scienceList of data structures

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
EFFICIENT CLUE-BASED ROUTE SEARCH ON ROAD NETWORKS
– The advances in positioning techniques and location-based services, it is currently very common for roads networks to get… 
2017
2017
Efficient Clue-Based Route Search on Road Networks
With the advances in geo-positioning technologies and location-based services, it is nowadays quite common for road networks to… 
2005
2005
Indexing Schemes for Efficient Aggregate Computation over Structural Joins
With the increasing popularity of XML as a standard for data representation and exchange, efficient XML query processing has… 
2004
2004
Concurrency Control and I/O-Optimality in Bulk Insertion
In a bulk update of a search tree a set of individual updates (insertions or deletions) is brought into the tree as a single… 
1999
1999
Fast approximate search algorithm for nearest neighbor queries in high dimensions
We present a fast approximate nearest neighbor (NN) search index structure called the AB-tree, which uses heuristics to decide… 
1999
1999
Efficient search scheme for very large image databases
Nearest Neighbor search is a fundamental task in many applications. At present state of the art, approaches to nearest neighbor… 
1997
1997
Early Experiences in Implementing the Buffer Tree
. 
1992
1992
TheSB-tree an index-sequential structure for high-performance sequential access
A variant of aB-tree known as anSB-tree is introduced, with the object of offering high-performance sequential disk access for… 
1992
1992
A robust and efficient spatial data structure
A new structure for organizing a set of multidimensional points called the nested interpolation-based grid file (NIBGF) is… 
1989
1989
Fault-tolerant analysis and algorithms for a proposed augmented binary tree architecture
An augmented binary (AB) tree architecture is proposed with a view to providing fault tolerance. This architecture is an… 
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)