answersLogoWhite

0


Best Answer

b-tree

User Avatar

Wiki User

15y ago
This answer is:
User Avatar
User Avatar

Olive Moss

Lvl 1
1y ago
Bad 👎
User Avatar

Olive Moss

Lvl 1
1y ago
My name is Gustavo Fring. But you can call me Gus

Add your answer:

Earn +20 pts
Q: Difference between B-tree and B tree?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Difference between a btree and b tree in datastructures?

They are the same thing - two different ways of writing B-Tree.


What is the difference between B-tree index and bitmap index?

less duplicvation and high co-ordinality in b-tree where as more duplication and less co-ordinality in mbitmap


What is the difference between a B A and a B S?

no answer


What is the difference between MCCB Type B C and D?

what is the difference between utilization category A and B of MCCB's


If the difference between A and B what are the values of A and B?

100


Explainthe different between B tree and B plus tree?

The B-tree is the classic disk-based data structure for indexing records based on an ordered key set. The B+-tree(sometimes written B+-tree, B+tree, or just B-tree) is a variant of the original B-tree in which all records are stored in the leaves and all leaves are linked sequentially. The B+-tree is used as a (dynamic) indexing method in relational database management systems.


What are difference between grade a b and c material?

The main difference is in between grade A,B & C IS THE CARBON CONTAIN OF THE MATERIALS.


What is the difference between b. and .b.?

one has .. and one has . its unequal


What is the difference between an A tech and a B tech?

one is A and one is B


What's the difference between a and b?

There are a few differences between a and b. A is a vowel and b is a consonant. A and b both have different sounds when pronounced.


Difference between B-tree and Binomial search tree?

A B-tree is a kind of tree data structure which is a generalization of a binary search tree where each node can have more than two children and contain more than 1 value. A Binominal search tree I am not sure of. If you mean Binary search tree, then it is an abstract data structure. Binominal is a term usually used with distributions while Binary is usually used with data. Hope this helps.


Difference between binary search tree and heap tree?

A binary search tree uses the definition: that for every node,the node to the left of it has a less value(key) and the node to the right of it has a greater value(key).Where as the heap,being an implementation of a binary tree uses the following definition:If A and B are nodes, where B is the child node of A,then the value(key) of A must be larger than or equal to the value(key) of B.That is,key(A) ≥ key(B).