Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 234,820,846 papers from all fields of science
Search
Sign In
Create Free Account
(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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
6 relations
2–3 tree
B-tree
Computer science
List of data structures
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
Locally Refined Collision Detection of Large Scale Complex Polygonal Meshes in Distributed Virtual Environments
Peiran Liu
,
N. Georganas
,
G. Roth
IEEE International Conference on Multimedia and…
2006
Corpus ID: 15550995
This paper presents a new locally refined collision detection approach for large scale complex meshes in distributed virtual…
Expand
2005
2005
Indexing Schemes for Efficient Aggregate Computation over Structural Joins
Priya Mandawat
,
V. Tsotras
International Workshop on the Web and Databases
2005
Corpus ID: 9826441
With the increasing popularity of XML as a standard for data representation and exchange, efficient XML query processing has…
Expand
2000
2000
An Efficient High-Dimensional Index Structure for Large Image Data
I. Yuk
,
Seok-Hui Lee
,
Jae-Su Yu
,
Ki-Hyung Cho
2000
Corpus ID: 64496384
In recent, many image data have been used typically because of computer and communication development. Accordingly, the methods…
Expand