翻訳と辞書 Words near each other ・ K-cell (mathematics) ・ K-Ci & JoJo ・ K-Ci & JoJo discography ・ K-Ci (singer) ・ K-citymarket ・ K-class blimp ・ K-class ferry ・ K-class sloop ・ K-class submarine ・ K-Club ・ K-Commando ・ K-Commerce ・ K-complex ・ K-convex function ・ K-d tree ・ K-D-B-tree ・ K-Day ・ K-Days ・ K-Dee ・ K-Def ・ K-Developedia ・ K-distribution ・ K-Dow Petrochemicals ・ K-Drama (rapper) ・ K-edge ・ K-edge-connected graph ・ K-Electric ・ K-Electric F.C. ・ K-epsilon turbulence model ・ K-equivalence Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク K-D-B-tree ： ウィキペディア英語版 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. == Informal description == Much like the ''k''-d tree, a K-D-B-tree organizes points in ''k''-dimensional space, useful for tasks such as range-searching and multi-dimensional database queries. K-D-B-trees subdivide space into two subspaces by comparing elements in a single domain. Using a 2-D-B-tree (2-dimensional K-D-B-tree) as an example, space is subdivided in the same manner as a ''k''-d tree: using a point in just one of the domains, or axes in this case, all other values are either less than or greater than the current value, and fall to the left and right of the splitting plane respectively. Unlike a ''k''-d tree, each half-space is not its own node. Instead, as in a B-tree, nodes in the K-D-B-tree are stored as pages and the tree stores a pointer to the root page. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「K-D-B-tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.