Secondary keys in a B-tree

Posted by Phenom on Stack Overflow See other posts from Stack Overflow or by Phenom
Published on 2010-05-08T07:45:55Z Indexed on 2010/05/08 7:48 UTC
Read the original article Hit count: 277

Filed under:

btree

Let's say that there is a file that contains an unsorted list of student information, which includes a student ID number as well as other information.

I want to make a program that retrieves student information based on student ID number. In order to make it efficient, I store the student IDs in a B-tree.

So when I enter a student ID number, it searches the B-tree to see if its there or not. It also does one more thing. If it finds the student ID number, then it also returns where in the file that student's information is. This is the secondary key. The program uses this information to locate the rest of the student's information and prints it to screen.

Can this be done? Is this how a b-tree works?

Related posts about btree

good ADT to implement BTREE

as seen on Stack Overflow - Search for 'Stack Overflow'
What data structure should I use to implement a BTree? Why? >>> More
How to traverse a Btree?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a Btree and I'm trying to figure out how traverse it so that the keys are displayed ascending order. All I can figure out is that this can be done with a recursive function. What's the pseudo-code to do it? >>> More
How to transverse a Btree?

as seen on Stack Overflow - Search for 'Stack Overflow'
I have a BST and I'm trying to figure out how transverse it so that the keys are displayed ascending order. All I can figure out is that this can be done with a recursive function. What's the pseudo-code to do it? >>> More
Existing implementation of Btree or B+tree in Java

as seen on Stack Overflow - Search for 'Stack Overflow'
I am doing a project in which I require btree or b+tree data structure. Does anyone know of an existing implementation of btree or b+tree (with insert, delete, search algorithms)? It should accept string as input and form btree or b+tree of these string. >>> More
Preoder traversal of a Btree

as seen on Stack Overflow - Search for 'Stack Overflow'
I'm trying to figure out how to do a preorder traversal of a Btree. I know that generally preorder traversal works like this: preorder(node) { print value in node preorder(left child) preorder(right child) } What's confusing to me is how to make this work with a Btree, since in each node there… >>> More

Developer IT