翻訳と辞書 Words near each other ・ Ubaté Province ・ Ubaté River ・ Ubauro ・ Ubauro Taluka ・ Ubava ・ Ubavoj nam Crnoj Gori ・ UB Law ・ UB Post ・ UB Post (Baltimore) ・ UB postcode area ・ Ub, Serbia ・ UB-14 ・ UB-165 ・ Ub-AMC ・ UB-Barça ・ UB-tree ・ UB.109T ・ UB1 ・ UB10 ・ UB11 ・ UB18 ・ UB2 ・ UB3 ・ UB4 ・ UB40 ・ UB40 (album) ・ UB40 discography ・ UB40 Live ・ UB44 ・ UB5 Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク UB-tree ： ウィキペディア英語版 UB-tree The UB-tree as proposed by Rudolf Bayer and Volker Markl is a balanced tree for storing and efficiently retrieving multidimensional data. It is basically a B+ tree (information only in the leaves) with records stored according to Z-order, also called Morton order. Z-order is simply calculated by bitwise interlacing the keys. Insertion, deletion, and point query are done as with ordinary B+ trees. To perform range searches in multidimensional point data, however, an algorithm must be provided for calculating, from a point encountered in the data base, the next Z-value which is in the multidimensional search range. The original algorithm to solve this key problem was exponential with the dimensionality and thus not feasible ("GetNextZ-address"). A solution to this "crucial part of the UB-tree range query" linear with the z-address bit length has been described later. This method has already been described in an older paper where using Z-order with search trees has first been proposed. ==References== 〔 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「UB-tree」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.