How B and B+ Trees are different (applications wise)?
up vote
-1
down vote
favorite
I know the conceptual differences between the two i.e. regarding key-value pairs, sequential access etc. I wanted to know how they are used in DBMS and are their any differences in the use of these trees?
database algorithm
asked Nov 21 at 19:27
Suyash Jain
296
add a comment |
up vote
-1
down vote
favorite
I know the conceptual differences between the two i.e. regarding key-value pairs, sequential access etc. I wanted to know how they are used in DBMS and are their any differences in the use of these trees?
database algorithm
asked Nov 21 at 19:27
Suyash Jain
296
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18
add a comment |
up vote
-1
down vote
favorite
up vote
-1
down vote
favorite
I know the conceptual differences between the two i.e. regarding key-value pairs, sequential access etc. I wanted to know how they are used in DBMS and are their any differences in the use of these trees?
database algorithm
asked Nov 21 at 19:27
Suyash Jain
296
I know the conceptual differences between the two i.e. regarding key-value pairs, sequential access etc. I wanted to know how they are used in DBMS and are their any differences in the use of these trees?
database algorithm
database algorithm
asked Nov 21 at 19:27
Suyash Jain
296
asked Nov 21 at 19:27
Suyash Jain
296
asked Nov 21 at 19:27
Suyash Jain
296
asked Nov 21 at 19:27
Suyash Jain
296
asked Nov 21 at 19:27
Suyash Jain
296
296
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18
add a comment |
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18
add a comment |
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Stack Overflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Some of your past answers have not been well-received, and you're in danger of being blocked from answering.
Please pay close attention to the following guidance:
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53419256%2fhow-b-and-b-trees-are-different-applications-wise%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
They serve the same purposes. B+trees are a little nicer in most cases, because having all the values in the leaves simplifies many operations and increases internal node fan-out.
– Matt Timmermans
Nov 21 at 20:18