K-D-B-tree
In computer science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide the search efficiency of a balanced k-d tree, while providing the block-oriented storage of a B-tree for optimizing external memory accesses.
Wikipage disambiguates
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
K-D-B-tree
In computer science, a K-D-B-tree (k-dimensional B-tree) is a tree data structure for subdividing a k-dimensional search space. The aim of the K-D-B-tree is to provide the search efficiency of a balanced k-d tree, while providing the block-oriented storage of a B-tree for optimizing external memory accesses.
has abstract
In computer science, a K-D-B-t ...... zing external memory accesses.
@en
Wikipage page ID
42,442,225
page length (characters) of wiki page
Wikipage revision ID
948,155,074
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In computer science, a K-D-B-t ...... zing external memory accesses.
@en
label
K-D-B-tree
@en