Help with B-tree algorithm!

Let's talk about algorithms!

Moderator: Board moderators

Post Reply
User avatar
Experienced poster
Posts: 146
Joined: Mon Feb 04, 2002 2:00 am
Location: VCORE.

Help with B-tree algorithm!

Post by hank » Mon Jul 04, 2005 8:54 am

B-tree is often used in database index storage.

I see my textbook, it said each key in the tree must be unique.

But how can I store two identical data in the B-tree?

Is it possible?

Thanks in advance! :P

A great helper
Posts: 430
Joined: Wed Jun 09, 2004 1:31 pm

Post by misof » Wed Jul 06, 2005 3:12 am

Depends on what you want to do with the stored data. Maybe keeping a counter [one integer representing the number of copies of the data] in each vertex would do the trick?

Post Reply

Return to “Algorithms”