HELP!

I'm having a difficult time implementing my B+ tree program in Java and would like to know if anyone can give me a hand. Does anyone have the B+ tree source code in Java or know where to find one? Thanks in advance.

I really hate my professor... one of the worst I've ever had. He's way too old to teach. I went to his office hour before class and at the end of the office hour, he asked me, "what class is it now? which room should I go to?" He makes his students teach the class for him most of the time, and when he finally lectures, he never makes any sense.

Any help is greatly appreciated. Thanks again.

 

I remember doing exactly this a long time ago.... but don't know where that stuff is now.

Do you at least understand the B-tree concept inside and out yet? Cause that's Step 1, and it sounds like your professor has trouble getting you to Step 1....?

 

[QUOTE]Originally posted by SteveUCI
[B]I remember doing exactly this a long time ago.... but don't know where that stuff is now.

Do you at least understand the B-tree concept inside and out yet?

 

that's lame.

This http://www.brpreiss.com/books/opus5/programs/ was the first google result I got on my search for "btree java search"

it's a bit down the page.

 

Thanks Josh

I need to find a B+ tree though... I tried searching for bplustree and the first search result is the link my professor gave us to go to for a demo.

 

Ah, the old B+ tree. This thing was a bitch for me and my buddies. We had to do it in C++ and I think we started 2 days before it was due!! A huge mistake. At least for a very average programmer when I was in school.

I found an applet. You can easily develop it as a non applet. Hope this helps.

http://www.seanster.com/BplusTree/source/

ERIK

 

[QUOTE]Originally posted by erik
[B]Ah, the old B+ tree.

 

Sorry i dont have a clue

 

What's a B+ tree? Is it a kind of binary tree? Like a balancing binary tree or something like that. It's been a while since I used that stuff.

 

Informally, a B+ tree is an n-ary tree with n variable but large (often >100).

A B+ tree of order v consists of a root, internal nodes and leaves. The root my be either leaf or node with two or more children. Internal nodes contain between v and 2v keys, and a node with k keys has k + 1 children. Leaves are always on the same level. If a leaf is a primary index, it consists of a bucket of records, sorted by search key. If it is a secondary index, it will have many short records consisting of a key and a pointer to the actual record.