I have two tab delimited text file which gives student personal information and college information

id firstname lastname adress...(i have seven columns like this) i am interested in the fifth column (which has student name)

similarly i have five columns in the college information text file,i am interested in the second column which has relationship of the student to the college(studentname;semester;subjecttaken).

what i want to do is read the two files(actual implementation has four files) pick up the columns that i am interested alone(store them in some datastructure )

then take up the (name;semester;subjecttaken1,subjecttaken2) data one by one,split the string if the name matches the studentname column of the student information file,i have to store them in a hashmap with studentname as key and semester and subjecttaken as values.

Can someone give me bestway to implement this logic.Since the data is very huge,i need to store the columns in a faster datastructure and loop them.I dont want to store them in a database.

04-21-2009, 06:38 PM

xcallmejudasx

What exactly needs to be faster because this can determine what you use. Do you want to read all the files and store it in a B_Tree or HashMap faster or you want to retrieve the data faster when it's already in one of those structures?