B trees implementation in java .

Question

0.00/5 (No votes)

See more:

For Implementation of B trees what data structure should I use to store the key values ? Should I use array of int type , Integer type or maybe linked list or something else .

What I have tried:

I am implementing code for B trees in Java .

Posted 21-Apr-18 8:33am

Member 13616463

Updated 21-Apr-18 20:20pm

Add a Solution

Comments

[no name] 21-Apr-18 19:11pm

B tree cries for linked list, at least for me.

Member 13616463 22-Apr-18 3:10am

If the BTree is itself stored on the disk then a linked list will make it very complicated to maintain.

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Mehdi Gholam · Answer 1 · 2018-04-21T20:21:00

Key values are usually stored within the b-tree structure in the leaf nodes.

Values for keys may be stored in the b-tree, but usually you would store them elsewhere and have leaf node "Key/Value"->"Key/pointer" point to another structure if the values are large (byte wise).

The actual "key/value" or "key/pointers" are usually stored in an array or list, depending on the functionality you want to have while searching, inserting and moving data around in the leaf nodes.