B-tree
Computer science, Tree (data structure), Self-balancing binary search tree
978-620-1-49109-0
6201491090
92
2012-08-19
34.00 €
eng
https://images.our-assets.com/cover/230x230/9786201491090.jpg
https://images.our-assets.com/fullcover/230x230/9786201491090.jpg
https://images.our-assets.com/cover/2000x/9786201491090.jpg
https://images.our-assets.com/fullcover/2000x/9786201491090.jpg
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In computer science, a B-tree is a tree data structure that keeps data sorted and allows searches, sequential access, insertions, and deletions in logarithmic time. The B-tree is a generalization of a binary search tree in that a node can have more than two children. Unlike self-balancing binary search trees, the B-tree is optimized for systems that read and write large blocks of data. It is commonly used in databases and filesystems. In B-trees, internal nodes can have a variable number of child nodes within some pre-defined range. When data is inserted or removed from a node, its number of child nodes changes.
https://www.morebooks.de/books/ru/published_by/fec-publishing/189845/products
Информатика, ИТ
https://www.morebooks.de/store/ru/book/b-tree/isbn/978-620-1-49109-0