Top "B-tree" questions

B-trees are a type of self balancing search tree where each node can hold multiple keys and all leaf nodes are the same distance from the root.

B-Tree vs Hash Table

In MySQL, an index type is a b-tree, and access an element in a b-tree is in logarithmic amortized time …

mysql data-structures computer-science complexity-theory b-tree
Max and min number of keys in a B-tree

What is the maximum and minimum number of keys that can be stored in a B-tree of order 128 and height 3? …

data-structures tree b-tree
AVL tree vs. B-tree

How is an AVL tree different from a B-tree?

data-structures b-tree avl-tree
Existing implementation of Btree or B+tree in Java

I am doing a project in which I require btree or b+tree data structure. Does anyone know of an …

java data-structures b-tree
Are there any B-tree programs or sites that show visually how a B-tree works

I found this website that lets you insert and delete items from a B-tree and shows you visually what the …

animation web b-tree
Advantage of BTREE?

I create indexes without the USING BTREE clause. Is there any advantage of using BTREE index? CREATE INDEX `SomeName` USING …

mysql b-tree database-indexes
When to choose RB tree, B-Tree or AVL tree?

As a programmer when should I consider using a RB tree, B- tree or an AVL tree? What are the …

data-structures tree b-tree avl-tree red-black-tree
B trees vs binary trees

If I am implementing in-memory(RAM) search operation with b trees, then would it be better in terms of caching …

performance binary-tree b-tree
javascript binary search tree implementation

Anyone know of any good examples of a simple BTree implementation in Javascript? I have a bunch of "things" arriving …

javascript sorting b-tree