K-D-B-tree
id:
k-d-b-tree-311-2570313
title:
K-D-B-tree
text:
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.
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/K-D-B-tree
date created:
date modified:
2023-08-26T08:34:14Z
main entity:
{"identifier":"Q17092964","url":"https://www.wikidata.org/entity/Q17092964"}
image:
fields total:
13
integrity:
13