What are Binay tress and B trees? Diff between them?
Answer Posted / nutan
A B-tree is a method of placing and locating files (called
records or keys) in a database when all the data is known
to be on DISK.
A Binary-tree is a method of placing and locating files
(called records or keys) in a database when all the data is
known to be in RAM.
It takes thousands of times longer to access a data element
from hard disk as compared with accessing it from RAM,
because a disk drive has mechanical parts, which read and
write data far more slowly than purely electronic media.
B-trees save time by using nodes with many branches (called
children), compared with binary trees, in which each node
has only two children. When there are many children per
node, a record can be found by passing through fewer nodes
than if there are two children per node.
Depth of a B-tree is smaller as compared to a binary tree
and hence B-tree allows a desired record to be located
faster, assuming all other system parameters are identical.
| Is This Answer Correct ? | 33 Yes | 3 No |
Post New Answer View All Answers
What is difference between array and vector in c++?
How does com provide language transparency?
Explain how to initialize a const data member.
What is the difference between prefix and postfix versions of operator++()?
In inline " expression passed as argument are evalauated once " while in macro "in some cases expression passed as argument are evaluated more than once " --> i am not getting it plz help to make me understand....
Explain the scope of resolution operator.
How does code-bloating occur in c++?
What is flag in computer?
What problems might the following macro bring to the application?
What does flush do?
What is the precedence when there is a global variable and a local variable in the program with the same name?
What is the difference between structures and unions?
If dog is a friend of boy, and terrier derives from dog, is terrier a friend of boy?
What are the benefits of c++?
Comment on local and global scope of a variable.