翻訳と辞書 |
Bx-tree In computer science, the Bx tree is a query and update efficient B+ tree-based index structure for moving objects. ==Index structure== The base structure of the Bx-tree is a B+ tree in which the internal nodes serve as a directory, each containing a pointer to its right sibling. In the earlier version of the Bx-tree,〔Christian S. Jensen, Dan Lin, and Beng Chin Ooi. (Query and Update Efficient B+tree based Indexing of Moving Objects ). In Proceedings of 30th International Conference on Very Large Data Bases (VLDB), pages 768-779, 2004.〕 the leaf nodes contained the moving-object locations being indexed and corresponding index time. In the optimized version,〔Dan Lin. (Indexing and Querying Moving Objects Databases ), PhD thesis, National University of Singapore, 2006.〕 each leaf node entry contains the id, velocity, single-dimensional mapping value and the latest update time of the object. The fanout is increased by not storing the locations of moving objects, as these can be derived from the mapping values.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Bx-tree」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|