In computer science, the Bx tree is a query that is used to update efficient B+ tree-based index structures 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 computer science, the Bx tree is a query that is used to update efficient B+ tree-based index structures 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.
Source: Wikipedia "Bx-tree" · CC BY-SA 4.0
Share this article: X · Bluesky